Results 1 to 10 of about 49,257 (158)
Small Turing universal signal machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding). After presenting signal machines, it is shown how to get universal ones from Turing machines, cellular-automata and ...
Jérôme Durand-Lose
doaj +8 more sources
A physically universal Turing machine
Journal of Computer and System Sciences, 2022 We construct a two-dimensional Turing machine that is physically universal in both the moving tape and moving head model. In particular, it is mixing of all finite orders in both models. We also provide a variant that is physically universal in the moving tape model, but not in the moving head model.
Ville Salo, Ilkka Törmä
openalex +4 more sources
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs).
Remco Loos, Florin Manea, Victor Mitrana
doaj +4 more sources
Simplicity via Provability for Universal Prefix-free Turing Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Universality is one of the most important ideas in computability theory. There are various criteria of simplicity for universal Turing machines. Probably the most popular one is to count the number of states/symbols.
Cristian S. Calude
doaj +3 more sources
Turing Automata and Graph Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras.
Miklós Bartha
doaj +4 more sources
Random strings and tt-degrees of Turing complete C.E. sets [PDF]
Logical Methods in Computer Science, 2014 We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends ...
Mingzhong Cai +4 more
doaj +3 more sources
Small fast universal Turing machines
Theoretical Computer Science, 2006 AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of (3,11), (5,7), (6,6), (7,5) and (8,4). These are the smallest known UTMs that simulate Turing machines in polynomial time.
Turlough Neary, Damien Woods
openalex +4 more sources
On quasi-unilateral universal Turing machines
Theoretical Computer Science, 2001 AbstractFour universal Turing machines are given with strong limitations on the number of left instructions in their program. One of the machines is morever non-erasing, i.e. it does not erase any 1 written on the tape.
Maurice Margenstern
openalex +3 more sources
Small weakly universal Turing machines
, 2007 We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110 and are currently the smallest known weakly universal Turing machines.
Turlough Neary, Damien Woods
openalex +5 more sources
Reversible Logic Elements with Memory and Their Universality [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used to build ...
Kenichi Morita
doaj +4 more sources