Results 1 to 10 of about 1,568 (209)
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 +7 more sources
Small weakly universal Turing machines [PDF]
, 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 +4 more sources
A Thermodynamically Universal Turing Machine [PDF]
, 2023 Expanding upon the widely recognized notion of mathematical universality in Turing machines, a concept of thermodynamic universality in Turing machines is introduced. Under the physical Church-Turing thesis, the existence of a thermodynamically universal Turing machine (TUTM) is demonstrated.
Jihai Zhu
openalex +3 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 +5 more sources
Small universal Turing machines
Theoretical Computer Science, 1996 Let UTMm, n be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist in the following classes: UTM24,2, UTM10,3, UTM7,4, UTM5,5, UTM4,6, UTM3,10 and UTM2,18.
Yurii Rogozhin
+6 more sources
Deutsch's Universal Quantum Turing Machine (Revisited) [PDF]
, 2007 Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits.
Willem L. Fouché +3 more
openalex +3 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
A Universal Reversible Turing Machine that Directly Simulates Reversible Counter Machines [PDF]
Computer Science Journal of MoldovaWe construct a 1-tape 98-state 10-symbol universal reversible Turing machine (URTM(98,10)) that directly simulates reversible counter machines (RCMs). The objective of this construction is not to minimize the numbers of states and tape symbols, but
Kenichi Morita
doaj +2 more sources
Self-Replicating Mechanical Universal Turing Machine [PDF]
This paper presents the implementation of a self-replicating finite-state machine (FSM) and a self-replicating Turing Machine (TM) using bio-inspired mechanisms. Building on previous work that introduced self-replicating structures capable of sorting, copying, and reading information, this study demonstrates the computational power of these mechanisms ...
Ralph P. Lano
openalex +3 more sources
An origami Universal Turing Machine design [PDF]
It has been known since 1996 that deciding whether a collection of creases on a piece of paper can be fully folded flat without causing self-intersection or adding new creases is an NP-Hard problem (Bern and Hayes). In their proof, a binary state was implemented as a pleat, with the state corresponding to the pleat layering order; states then interact ...
Michael Assis
openalex +3 more sources