Skip to search formSkip to main contentSkip to account menu

Turing machine

Known as: Universal computing machine, Deterministic Turing machine, The Turing Machine 
A Turing machine is an abstract machine that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AC0AI-completeAbstract machineAlgorithmic learning theory

Broader (2)

Formal methodsTheoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Circuits, computers, and beyond Boolean logic
Historically, the invention of the stored programmable computer architecture, introduced by John Von Neumann, was also influenced… 
2002
2002
Self-reproduction in asynchronous cellular automata
Building on the work of Von Neumann, Burks, Codd, and Langton, among others, we introduce the first examples of asynchronous self… 
Highly Cited
2001
Highly Cited
2001
Parameter space analysis, pattern sensitivity and model comparison for Turning and stationary flow-distributed waves (FDS)
1999
1999
Fault-tolerant design of analogic CNN templates and algorithms-Part I: The binary output case
This paper addresses the issue of designing a class of fault-tolerant cellular neural network (CNN) templates that, combined with… 
1997
1997
Verification with Abstract State Machines Using MDGs
The presence of uninterpreted symbols in the logic means that we must distinguish between a state machine M and its abstract… 
1990
1990
Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines
Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an… 
1988
1988
Relativized Alternation and Space-Bounded Computation
  • J. Buss
  • Journal of computer and system sciences (Print)
  • 1988
  • Corpus ID: 8161929
1985
1985
The Universal Machine: Confessions of a Technological Optimist
Review
1984
Review
1984
Decision Problems in Predicate Logic
1974
1974
Bounded-Reversal Multihead Finite Automata Languages
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)