AbstractA decision procedure is given which makes essential use of concepts in discrete geometry. The procedure decides for any one-state Turing machine with three-dimensional tape, whether or not it has an immortal configuration, i.e., it solves the uniform halting problem for such devices. The history and significance of the problem is examined. The solution is given with the main motivation of showing how traditional mathematical concepts can be used in decision procedures. The paper is introductory in the sense that all notions are carefully defined
AbstractAfter recalling the definition of decidability and universality, we first give a survey of r...
This paper interprets work on understanding the actions of Turing machines operating on an initially...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
AbstractA decision procedure is given which makes essential use of concepts in discrete geometry. Th...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
The article examines the possibility of the formalization of the main stages of a detail mechanical ...
AbstractThis paper discusses recent developments that emphasize the role of discrete mathematics in ...
As far back as Euclid's ruler and compass constructions, computation and geometry have been domains ...
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather ...
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts I...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
ABSTRACT We reexamine fundamental problems from computational geometry in the word RAM model, where ...
AbstractLet TM(k,l) be the set of one-tape Turing machines with k states and l symbols. It is known ...
Turing assemblers are Turing machines which operate on n-dimensional tapes under restrictions which ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractAfter recalling the definition of decidability and universality, we first give a survey of r...
This paper interprets work on understanding the actions of Turing machines operating on an initially...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
AbstractA decision procedure is given which makes essential use of concepts in discrete geometry. Th...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
The article examines the possibility of the formalization of the main stages of a detail mechanical ...
AbstractThis paper discusses recent developments that emphasize the role of discrete mathematics in ...
As far back as Euclid's ruler and compass constructions, computation and geometry have been domains ...
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather ...
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts I...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
ABSTRACT We reexamine fundamental problems from computational geometry in the word RAM model, where ...
AbstractLet TM(k,l) be the set of one-tape Turing machines with k states and l symbols. It is known ...
Turing assemblers are Turing machines which operate on n-dimensional tapes under restrictions which ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractAfter recalling the definition of decidability and universality, we first give a survey of r...
This paper interprets work on understanding the actions of Turing machines operating on an initially...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...