Skip to search formSkip to main contentSkip to account menu

Church–Turing thesis

Known as: Churchs thesis, Church Turing thesis, The Church-Turing thesis 
In computability theory, the Church–Turing thesis (also known as Computability Thesis, the Turing–Church thesis, the Church–Turing conjecture, Church… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
An investigation on the impact and significance of the AlphaGo vs. Lee Sedol Go match is conducted, and concludes with a… 
2016
2016
cell containing a left end marker ` (never written over) and extends to infinitely many cells to the right. This machine has a… 
Highly Cited
2008
Highly Cited
2008
Abstract Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones… 
Highly Cited
2007
Highly Cited
2007
There are various equivalent formulations of the Church-Turing thesis. A common one is that every effective computation can be… 
Highly Cited
2005
Highly Cited
2005
How to address empirically the calculative character of markets without dissolving it? In our paper, we propose a theoretical… 
Highly Cited
2005
Highly Cited
2005
According to the interactive view of computation, communication happens during the computation, not before or after it. This… 
2005
2005
The Church–Turing Thesis (CTT) is often employed in arguments for computationalism. I scrutinize the most prominent of such… 
Highly Cited
2004
Highly Cited
2004
The Church-Turing thesis makes a bold claim about the theoretical limits to computation. It is based upon independent analyses of… 
Review
1997
Review
1997
Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a variant of the Eleatic argument… 
Highly Cited
1990
Highly Cited
1990
We describe initial results from an apparatus and protocol designed to implement quantum public key distribution, by which two…