
Church's Thesis After 70 Years
- 551 pages
- English
- PDF
- Available on iOS & Android
Church's Thesis After 70 Years
About this book
Church's Thesis (CT) was first published by Alonzo Church in 1935. CT is a proposition that identifies two notions: an intuitive notion of a effectively computable function defined in natural numbers with the notion of a recursive function. Despite of the many efforts of prominent scientists, Church's Thesis has never been falsified. There exists a vast literature concerning the thesis. The aim of the book is to provide one volume summary of the state of research on Church's Thesis. These include the following: different formulations of CT, CT and intuitionism, CT and intensional mathematics, CT and physics, the epistemic status of CT, CT and philosophy of mind, provability of CT and CT and functional programming.
Tools to learn more effectively

Saving Books

Keyword Search

Annotating Text

Listen to it instead
Information
Table of contents
- Preface
- Darren Abramson€Churchâs Thesis and Philosophy of Mind
- Andreas Blass, Yuri Gurevich€Algorithms: A Quest for Absolute Definitions
- Douglas S. Bridges€Churchâs Thesis and Bishopâs Constructivism
- Selmer Bringsjord, Konstantine Arkoudas€On the Provability, Veracity, and AI-Relevance of the ChurchâTuring Thesis
- Carol E. Cleland€The ChurchâTuring Thesis. A Last Vestige of a Failed Mathematical Program
- B. Jack Copeland€Turingâs Thesis
- Hartmut Fitz€Churchâs Thesis and Physical Computation
- Janet Folina€Churchâs Thesis and the Variety of Mathematical Justifications
- Andrew Hodges€Did Church and Turing Have a Thesis about Machines?
- Leon Horsten€Formalizing Churchâs Thesis
- Stanislaw Krajewski€Remarks on Churchâs Thesis and Gödelâs Theorem
- Charles McCarty€Thesis and Variations
- Elliott Mendelson€On the Impossibility of Proving the âHard-Halfâ of Churchâs Thesis
- Roman Murawski, Jan Wolenski€The Status of Churchâs Thesis
- Jerzy Mycka€Analog Computation and Churchâs Thesis
- Piergiorgio Odifreddi€Kreiselâs Church
- Adam Olszewski€Churchâs Thesis as Formulated by Church â An Interpretation
- Oron Shagrir€Gö del on Turing on Computability
- Stewart Shapiro€Computability, Proof, and Open-Texture
- Wilfried Sieg€Step by Recursive Step: Churchâs Analysis of Effective Calculability
- Karl Svozil€Physics and Metaphysics Look at Computation
- David Turner€Churchâs Thesis and Functional Programming
- Index
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app