Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Introduction to algorithms
Hilbert's tenth problem
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
| Hi-index | 0.00 |
Hermes (1965). "An algorithm is a general proce- dure such that for any appropriate question the answer can be obtained by the use of a simple computation according to a specified method ... [A] general procedure [is] a process the execution of which is clearly specified to the smallest details."