I've been itching my head over this for a while despite going through the queries related to the topic. Can someone explain me negligible and non-negligible function in a concise way?
As of my naive understanding (correct me if I've the wrong take);
A non-negligible function is one which approaches zero relatively slow (eg: reciprocal of polynomial function as compared to exponential function) and given enough computationally possible time and space, such function is breakable after, poly(n) time.
A negligible function is one which approaches zero quickly and is computationally infeasible to break as the function grows faster with time. e.g. $\frac{1}{k^n}$
I don't understand how $\epsilon(\lambda) \geq \frac{1}{\lambda^n}$ is non-negligible and $\lambda \geq \lambda_d: \epsilon(\lambda) \leq \frac{1}{\lambda^n}$ is negligible. Also, what's $\lambda_d$ suppose to mean?
