What is the Church-Turing Thesis?
From MaRDI portal
Publication:5055286
DOI10.1007/978-3-030-77799-9_9OpenAlexW4296129219MaRDI QIDQ5055286
Publication date: 13 December 2022
Published in: Axiomatic Thinking II (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-77799-9_9
Philosophical and critical aspects of logic and foundations (03A05) History of mathematical logic and foundations (03-03)
Related Items
Cites Work
- The computable kernel of abstract state machines
- The influence of domain interpretations on computational models
- Why was Wantzel overlooked for a century? The changing importance of an impossibility result
- Acceptable notation
- A foundation of finite mathematics
- Why Gödel's theorem cannot refute computationalism
- Superminds. People harness hypercomputation, and more
- Quantum algorithm for Hilbert's tenth problem
- On the mechanization of straightedge and compass constructions
- Representations of natural numbers and computability of various functions
- Computability and realizability for interactive computations
- On some recent criticism of Church's thesis
- Church's thesis and the conceptual analysis of computability
- Physical constraints on hypercomputation
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem
- A hypercomputational alien
- The Church-Turing thesis: Still valid after all these years?
- Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
- Locality and information transfer in quantum operations
- Is there a ``Hilbert thesis?
- \(\lambda\)-definability and recursiveness
- Proving Church's Thesis
- Second Thoughts about Church's Thesis and Mathematical Proofs
- What Is an Algorithm?
- An Interview with Herbert Robbins
- Axiomatizing Analog Algorithms
- Automata Studies. (AM-34)
- Comparing Computational Power
- Hypercomputation
- Three Paths to Effectiveness
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Why Gödel didn't have church's thesis
- On the Definition of Computable Function of a Real Variable
- Computational Complexity of Probabilistic Turing Machines
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Church's Thesis: Prelude to a Proof
- Step by Recursive Step: Church's Analysis of Effective Calculability
- The Impact of the Lambda Calculus in Logic and Computer Science
- Hypercomputation and the Physical Church‐Turing Thesis
- Outline of a Theory of Truth
- Theses for Computation and Recursion on Concrete and Abstract Structures
- Proving Things About the Informal
- Origins of Recursive Function Theory
- THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY
- Axioms for Computability: Do They Allow a Proof of Church’s Thesis?
- The Physical Church–Turing Thesis: Modest or Bold?
- Unconstrained Church-Turing thesis cannot possibly be true
- Kalmár's Argument Against the Plausibility of Church's Thesis
- True Random Number Generators
- An impossible program
- Church Without Dogma: Axioms for Computability
- The Four Sons of Penrose
- Interactive Computation
- The Church-Turing Thesis over Arbitrary Domains
- Trial and error predicates and the solution to a problem of Mostowski
- Limiting recursion
- Machines, Computations, and Universality
- New Computational Paradigms
- Sequential abstract-state machines capture sequential algorithms
- Finite combinatory processes—formulation
- Logical Approaches to Computational Barriers
- Non-Turing computations via Malament--Hogarth space-times
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
