scientific article; zbMATH DE number 1984273
These investigations aim to provide a characterization of computations by machines that is as general and convincing as that of computations by human computors given by Turing. The groundwork was laid by \textit{R. Gandy}'s paper ``Church's thesis and principles for mechanisms [in: J. Barwise et al. (eds.), The Kleene Symp., Proc., Madison/Wis. 1978, Stud. Log. Found. Math. 101, 123-148 (1980; Zbl 0465.03022)]. In a survey article, published ten years after Gandy's paper, Lamport and Lynch argue that the theory of sequential computing rests on fundamental concepts of computability that are independent of any particular computation model. The conceptional analysis of calculations by man and machine of the present paper is given by a systematic mathematical presentation. For the entire collection see [Zbl 1017.00016].
- What is an algorithm?
- Foundational analyses of computation
- scientific article; zbMATH DE number 4072939 (Why is no real title available?)
- scientific article; zbMATH DE number 4108154 (Why is no real title available?)
- Conceptual Confluence in 1936: Post and Turing
- Theses for computation and recursion on concrete and abstract structures
- Proving Things About the Informal
- scientific article; zbMATH DE number 1869994 (Why is no real title available?)
- scientific article; zbMATH DE number 1870428 (Why is no real title available?)
- Paper Machines
- Axioms for computability: do they allow a proof of Church's thesis?
- The dependence of computability on numerical notations
- Explication as a three-step procedure: the case of the Church-Turing thesis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4428707)