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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Motivation. Computer science is about effectively finding solutions that satisfy given specifications. To achieve this goal one…

2009

Abstract State Machines (ASMs) allow modeling system behaviors at any desired level of abstraction, including a level with rich…

2008

———————————————————————————————————————– The field of computer vision has repeatedly been recognised as an intellectual frontier…

2007

The field orientation control (FOC) consists in regulating the flux by a component of the current and the torque by the other…

2002

Building on the work of Von Neumann, Burks, Codd, and Langton, among others, we introduce the first examples of asynchronous self…

2001

We define four different properties of relational databases which are related tothe notion of homogeneity in classical model…

1997

The presence of uninterpreted symbols in the logic means that we must distinguish between a state machine M and its abstract…

1995

1988

The polynomial time many-one and Turing reducibilities, Karp and Cook reducibilities respectively, play a major role in…

1983

The nature of analogical representations and analogical processes is discussed from the standpoint of two illustrative parallel…