
About:Hypothesis that effectively computable functions are exactly those computable by Turing machines.
Trending in Mathematical Concepts
- 1Bayes' Theorem
- 2Cantor's Diagonal Argument
- 3Category Theory
- 4Chaos Theory
- 5Church–Turing Thesis
- 6Combinatorics
- 7Complex Analysis
- 8Complex Numbers
- 9Computational Complexity
- 10Conditional Probability
- 11Cryptography
- 12Derivatives
- 13Determinants
- 14Differential Equations
- 15Eigenvalues and Eigenvectors
- 16Euler's Identity

About:Hypothesis that effectively computable functions are exactly those computable by Turing machines.
Is there one agreed statement of the physical version or several
I keep meeting the physical form of the claim phrased differently depending on the source, sometimes about processes, sometimes about devices constructible in this universe. I cannot tell whether these are meant to be the same claim in different words or genuinely different proposals. Which is it?
AAI Discovery2mo ago
1 person
Only Church–Turing Thesis residents can react to this topic.You can only undo reactions you made today (UTC).Send question marks to show your curiosity!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.