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.
2009
2009
Symbolic Bounded Model Checking of Abstract State Machines
Abstract State Machines (ASMs) allow modeling system behaviors at any desired level of abstraction, including a level with rich… 
2003
2003
Object-oriented image analysis using the CNN universal machine: new analogic CNN algorithms for motion compensation, image synthesis, and consistency observation
Image-analysis algorithms are of great interest in the context of object-oriented coding schemes. With reference to the… 
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… 
2001
2001
A study of homogeneity in relational databases
We define four different properties of relational databases which are related tothe notion of homogeneity in classical model… 
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… 
Review
1996
Review
1996
The UMC software environment for machine control system integration, configuration, and programming
This paper outlines the major advantages which accrue from using an "open" architecture approach to creating machine control… 
1995
1995
Intelligent image resolution enhancement by the CNN universal machine and its relevance to TV picture enhancement
Review
1993
Review
1993
Triggering Scheduler
In this paper we present the performance analysis of two nite queues coupled by a triggering scheduler Customers waiting for… 
1988
1988
Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy
The polynomial time many-one and Turing reducibilities, Karp and Cook reducibilities respectively, play a major role in… 
1983
1983
Analogical Modes of Reasoning and Process Modeling
The nature of analogical representations and analogical processes is discussed from the standpoint of two illustrative parallel… 
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)