"- It consists of a finite number of exact, finite instructions.
- When it is applied to a problem from its class:
- It always finishes (terminates) after a finite number of steps.
- It always produces a correct answer.
- In principle, it can be done by a human without any aids except writing materials.
- Its instructions need only to be followed rigorously to succeed. In other words, it requires no ingenuity to succeed."
"Several independent efforts to give a formal characterization of effective calculability led to a variety of proposed definitions (general recursion, Turing machines, λ-calculus) that later were shown to be equivalent."
https://en.wikipedia.org/wiki/Effective_method
"- It consists of a finite number of exact, finite instructions.
- When it is applied to a problem from its class:
- In principle, it can be done by a human without any aids except writing materials.- Its instructions need only to be followed rigorously to succeed. In other words, it requires no ingenuity to succeed."
"Several independent efforts to give a formal characterization of effective calculability led to a variety of proposed definitions (general recursion, Turing machines, λ-calculus) that later were shown to be equivalent."