Results 171 to 180 of about 1,568 (209)

MINSKY'S SMALL UNIVERSAL TURING MACHINE

International Journal of Mathematics, 1991
Marvin L. Minsky constructed a 4-symbol 7-state universal Turing machine in 1962. It was first announced in a postscript to [2] and is also described in [3, Sec. 14.8]. This paper contains everything that is needed for an understanding of his machine, including a complete description of its operation. Minsky's machine remains one of the minimal known
openaire   +1 more source

Universal Counter Machine—Turing Machine

2015
Paul Chapman’s universal counter machine described in Chap. 3 is universal because it can simulate an arbitrary counter machine. It has been shown by Minsky that a counter machine can also simulate an arbitrary Turing machine. This chapter describes such a machine implemented by the author in Conway’s Game of Life and compares this with Paul Chapman’s ...
openaire   +1 more source

A simplified universal Turing machine

Proceedings of the 1952 ACM national meeting (Toronto) on - ACM '52, 1952
In 1936 Turing (1) defined a class of logical machines (which he called a - machines, but which are now generally called Turing machines) which he used as an aid in proving certain results in mathematical logic, and which should prove of interest in connection with the theory of control and switching systems. Given any logical operation or arithmetical
openaire   +1 more source

Alan Turing's other universal machine

Communications of the ACM, 2012
Reflections on the Turing ACE computer and its influence.
openaire   +1 more source

Three Small Universal Turing Machines

2001
We are interested by "small" Universal Turing Machines (in short: UTMs), in the framework of 2, 3 or 4 tape-symbols. In particular: - 2 tape-symbols. Apart from the old 24-states machine constructed by Rogozhin in 1982, we know two recent examples requiring 22 states, one due to Rogozhin and one to the author. - 3 tape-symbols. The best example we know,
openaire   +2 more sources

The CNN Universal Machine is as universal as a Turing Machine

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 1996
It is shown that the simplest integrated circuit implementations of the CNN Universal Machine can play the "game of life", and are therefore equivalent to Turing Machines. In addition, a constructive proof is given for the direct implementation of general first-order cellular automata on such machines.
K.R. Crounse, L.O. Chua
openaire   +1 more source

Fuzzy Turing Machines: Variants and Universality

IEEE Transactions on Fuzzy Systems, 2008
In this paper, we study some variants of fuzzy Turing machines (FTMs) and universal FTM. First, we give several formulations of FTMs, including, in particular, deterministic FTMs (DFTMs) and nondeterministic FTMs (NFTMs). We then show that DFTMs and NFTMs are not equivalent as far as the power of recognizing fuzzy languages is concerned. This contrasts
openaire   +1 more source

From Universal Turing Machines to Self-Reproduction*

1990
Abstract Although Turing in his later years became interested in the use of reaction diffusion equations to model morphogenesis (cf. Turing 1952) my task in this essay is to trace the way in which Turing’s notion of the universal computer led to a computational theory of organism growth and reproduction.
openaire   +1 more source

Splicing Systems for Universal Turing Machines

2005
In this paper, we look at extended splicing systems (i.e., H systems) in order to find how small such a system can be in order to generate a recursively enumerable language. It turns out that starting from a Turing machine M with alphabet A and finite set of states Q which generates a given recursively enumerable language L, we need around 2 × |I| +
Tero Harju, Maurice Margenstern
openaire   +1 more source

Turing’s Thesis and the Universality of the Turing Machine

2002
In this chapter, we investigate Turing’s thesis, which essentially says that the Turing machine (TM) is the most powerful computational device of all. We find evidence to support the thesis by considering a special TM called the Universal TM (UTM).
openaire   +1 more source