Results 191 to 200 of about 50,371 (207)

Approximation and universality of fuzzy Turing machines

Science in China Series F: Information Sciences, 2008
Fuzzy Turing machines are the formal models of fuzzy algorithms or fuzzy computations. In this paper we give several different formulations of fuzzy Turing machine, which correspond to nondeterministic fuzzy Turing machine using max-⋆ composition for some t-norm ⋆ (or NFTM⋆, for short), nondeterministic fuzzy Turing machine (or NFTM), deterministic ...
openaire   +2 more sources

Universal Reversible Turing Machines

2017
In this chapter, the problem of finding small universal Turing machines (UTMs) that satisfy the reversibility condition is studied. Such UTMs are called universal reversible Turing machines (URTMs). Let URTM(m,n) denote an m-state n-symbol URTM.We give several URTM(m,n)’s with small m and n.
openaire   +2 more sources

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   +2 more sources

Cartesian Dualism, and Universe as Turing Machine

Philosophy Today, 2003
In the field of computability and algorithmicity, there have recently been two essays that are, in my opinion, of great interest: Peter Slezak's "Descartes's Diagonal Deduction," and David Deutsch's "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer." Briefly, the former shows that Descartes's Cogito argument is, in crucial
openaire   +2 more sources

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   +2 more sources

Alan Turing's other universal machine

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

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

A Simple and Efficient Universal Reversible Turing Machine

2011
We construct a universal reversible Turing machine (URTM) from first principles. We take a strict approach to the semantics of reversible Turing machines (RTMs), under which they can compute exactly all injective, computable functions, but not non-injective ones.
Axelsen, Holger Bock, Glück, Robert
openaire   +3 more sources

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

Universality of Turing Machine and Its Limitations

2011
The universal Turing machine is the one that, when given a description of Turing machine M and input w, can simulate the behavior of M with input w. In this chapter we construct the universal Turing machine. This means that the universal Turing machine can behave like any Turing machine with any input if the description of the Turing machine to be ...
openaire   +2 more sources