What is the Church-Turing Thesis?
From MaRDI portal
Cites work
- \(\lambda\)-definability and recursiveness
- A foundation of finite mathematics
- A hypercomputational alien
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem
- Abstract effective models
- Acceptable notation
- An impossible program
- An Interview with Herbert Robbins
- Automata Studies. (AM-34)
- Axiomatizing analog algorithms
- Axioms for computability: do they allow a proof of Church's thesis?
- Church Without Dogma: Axioms for Computability
- Church's thesis and the conceptual analysis of computability
- Church's Thesis: Prelude to a Proof
- Comparing Computational Power
- Computability and realizability for interactive computations
- Computational Complexity of Probabilistic Turing Machines
- Finite combinatory processes—formulation
- scientific article; zbMATH DE number 1687041 (Why is no real title available?)
- scientific article; zbMATH DE number 3882394 (Why is no real title available?)
- scientific article; zbMATH DE number 3139757 (Why is no real title available?)
- scientific article; zbMATH DE number 3144511 (Why is no real title available?)
- scientific article; zbMATH DE number 3982517 (Why is no real title available?)
- scientific article; zbMATH DE number 4021069 (Why is no real title available?)
- scientific article; zbMATH DE number 4068851 (Why is no real title available?)
- scientific article; zbMATH DE number 3727583 (Why is no real title available?)
- scientific article; zbMATH DE number 3728250 (Why is no real title available?)
- scientific article; zbMATH DE number 3771759 (Why is no real title available?)
- scientific article; zbMATH DE number 4128774 (Why is no real title available?)
- scientific article; zbMATH DE number 1260390 (Why is no real title available?)
- scientific article; zbMATH DE number 610563 (Why is no real title available?)
- scientific article; zbMATH DE number 722586 (Why is no real title available?)
- scientific article; zbMATH DE number 727991 (Why is no real title available?)
- scientific article; zbMATH DE number 1093813 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- scientific article; zbMATH DE number 1869994 (Why is no real title available?)
- scientific article; zbMATH DE number 1869997 (Why is no real title available?)
- scientific article; zbMATH DE number 1869998 (Why is no real title available?)
- scientific article; zbMATH DE number 1909823 (Why is no real title available?)
- scientific article; zbMATH DE number 1390011 (Why is no real title available?)
- scientific article; zbMATH DE number 6308207 (Why is no real title available?)
- scientific article; zbMATH DE number 5064395 (Why is no real title available?)
- scientific article; zbMATH DE number 5064404 (Why is no real title available?)
- scientific article; zbMATH DE number 3260773 (Why is no real title available?)
- scientific article; zbMATH DE number 3051296 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Hypercomputation
- Hypercomputation and the Physical Church‐Turing Thesis
- Interactive Computation
- Introduction to mathematical logic
- Is there a ``Hilbert thesis?
- Kalmár's argument against the plausibility of Church's thesis
- Limiting recursion
- Locality and information transfer in quantum operations
- Logical Approaches to Computational Barriers
- Machines, Computations, and Universality
- New Computational Paradigms
- Non-Turing computations via Malament--Hogarth space-times
- On some recent criticism of Church's thesis
- On the Definition of Computable Function of a Real Variable
- On the mechanization of straightedge and compass constructions
- Origins of Recursive Function Theory
- Outline of a Theory of Truth
- Physical constraints on hypercomputation
- Proving Church's thesis
- Proving Things About the Informal
- Quantum algorithm for Hilbert's tenth problem
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Representations of natural numbers and computability of various functions
- Second thoughts about Church's thesis and mathematical proofs
- Sequential abstract-state machines capture sequential algorithms
- Step by Recursive Step: Church's Analysis of Effective Calculability
- Superminds. People harness hypercomputation, and more
- The Church-Turing Thesis over Arbitrary Domains
- The Church-Turing thesis: Still valid after all these years?
- The computable kernel of abstract state machines
- The Four Sons of Penrose
- The Impact of the Lambda Calculus in Logic and Computer Science
- The influence of domain interpretations on computational models
- The physical Church-Turing thesis and the principles of quantum theory
- The physical Church-Turing thesis: modest or bold?
- The universal computer. The road from Leibniz to Turing
- Theses for computation and recursion on concrete and abstract structures
- Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
- Three paths to effectiveness
- Trial and error predicates and the solution to a problem of Mostowski
- True Random Number Generators
- Unconstrained Church-Turing thesis cannot possibly be true
- What is an algorithm?
- Why Gödel didn't have church's thesis
- Why Gödel's theorem cannot refute computationalism
- Why was Wantzel overlooked for a century? The changing importance of an impossibility result
Cited in
(3)
This page was built for publication: What is the Church-Turing Thesis?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055286)
