Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Turing's analysis of computability, and major applications of it
A half-century survey on The Universal Turing Machine
The confluence of ideas in 1936
A half-century survey on The Universal Turing Machine
Alan Turing
Origins of Recursive Function Theory
IEEE Annals of the History of Computing
Output concepts for accelerated Turing machines
Natural Computing: an international journal
| Hi-index | 0.00 |
The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930's working on various precise definitions and demonstrations of a function specified by a finite procedure and that they should all share approximately equal credit. This is incorrect. It was Turing alonewho achieved the characterization, in the opinion of Gödel. We also explore Turing's oracle machine and its analogous properties in analysis.