<--- Back to Details
First PageDocument Content
Computability theory / Theory of computation / Turing machine / Alan Turing / Universal Turing machine / Halting problem / Computability / Computable number / Algorithm / Theoretical computer science / Applied mathematics / Mathematics
Date: 2007-12-14 11:41:15
Computability theory
Theory of computation
Turing machine
Alan Turing
Universal Turing machine
Halting problem
Computability
Computable number
Algorithm
Theoretical computer science
Applied mathematics
Mathematics

Add to Reading List

Source URL: cob.jmu.edu

Download Document from Source Website

File Size: 113,50 KB

Share Document on Facebook

Similar Documents

The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing Machine

DocID: 1uZDW - View Document

Computability theory / Theoretical computer science / Formal methods / Models of computation / Lambda calculus / Eval / Scheme / Env / Interpreter / Anonymous function / Halting problem / Turing machine

Microsoft PowerPoint - universal_machinesv2.ppt

DocID: 1pi6P - View Document

Turing machine / Computability theory / Theory of computation / Models of computation / Alan Turing / Universal Turing machine / Turing completeness / Kolmogorov complexity / Computational complexity theory / ChurchTuring thesis / Cellular automaton / Computer

Additively efficient universal computers Daniel Dewey∗ Oxford Martin Programme on the Impacts of Future Technology, Future of Humanity Institute

DocID: 1p8Jt - View Document

quantum machines… for computing the universal Turing machine Alan Turing Church-Turing

DocID: 1njgx - View Document

Logical Depth and Physical Complexity Charles H. Bennett IBM Research, Yorktown Heights NY 10598, USA ppin The Universal Turing Machine– a Half-Century Survey, edited by Rolf Herken, Oxford University Press (

DocID: 1kMAF - View Document