Affiliation:
1. Department of Mathematics, University of Chicago, 5734 University Avenue, Chicago, IL 60637-1546, USA
Abstract
The model of recursive functions in 1934–1936 was a deductive formal system. In 1936, Turing and in 1944, Post introduced more intuitive models of Turing machines and generational systems. When they both died prematurely in 1954, their informal approach was replaced again by the very formal Kleene
T
-predicate for another decade. By 1965, researchers could no longer read the papers. A second wave of intuition arose with the book by Rogers and Lachlan's revealing papers. A third wave of intuition has arisen from 1996 to the present with a return to the original meaning of computability in the sense of Turing and Gödel, and a return of ‘recursive’ to its original meaning of ‘inductive’ and the founding of
Computability in Europe
by Cooper and others.
Subject
General Physics and Astronomy,General Engineering,General Mathematics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The never-ending recursion;Journal of Applied Logic;2017-12
2. Turing Computability;Theory and Applications of Computability;2016
3. Why Turing’s Thesis Is Not a Thesis;Turing’s Revolution;2015
4. A personal account of Turing’s imprint on the development of computer science;Computer Science Review;2012-11
5. The foundations of computation, physics and mentality: the Turing legacy;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2012-07-28