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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in… 
2014
2014
Boson-sampling is a highly simplified, but non-universal, approach to implementing optical quantum computation. It was shown by… 
2007
2007
The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had… 
2006
2006
This article draws attention to a central dispute in the interpretation of Church’s Thesis. More precisely, we are concerned with… 
2005
2005
"A function is mechanically computable (that is: computable by means of a machine) if and only if it is Turing-computable." 
2005
2005
Abstract In complex industrial plants, there are usually lots of sensors and the modelling of the plant leads to lots of… 
Review
2000
Review
2000
The rejuvenation of international law in the last decade has its source in two developments. On the one hand, "critical legal… 
Highly Cited
1981
1968
1968
________________________________________ Introduction. ______________________________________ Fieldwork and exploratory and…