DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Description number
Description number
Algorithms, Turing Machines and Algorithmic Undecidability
On the Progression of Finding the Smallest Known Universal Turing Machine
Estimating Algorithmic Information Using Quantum Computing for Genomics Applications
The Entscheidungsproblem and Alan Turing
Computable Diagonalizations and Turing's Cardinality Paradox
Samplestanford University, Stanford, CA 94305 Turing Machines Copyright C 2021 by the Author
A Stronger Foundation for Computer Science and P= NP
Observability of Turing Machines: a Refinement of the Theory Of
Arxiv:2006.00987V1 [Quant-Ph] 1 Jun 2020 Complexity Estimation Techniques
Wittgenstein's Diagonal Argument
Some Consequences of a Recursive Number-Theoretic Relation That Is Not the Standard Interpretation of Any of Its Formal Representations
Turing, His Machine and Computability
FINAL Submit Uppsala 5 26 11 Hdr + No Comments
An Exercise in Unplugging the Church-Turing Thesis
Wittgenstein's Remarks on Mathematics, Turing, and Computability
Estimating Algorithmic Information Using Quantum Computing for Genomics Applications
Sample PDF Entry on Turing Machines
Alan Turing and Human-Like Intelligence
Top View
Alan Turing: the Logical and Physical Basis of Computing
The Halting Problem:Proofsand Demos
Problems with the Halting Problem
Wittgenstein's Diagonal Argument: a Variation on Cantor and Turing