Results 11 to 20 of about 50,371 (207)
Small Semi-Weakly Universal Turing Machines [PDF]
Fundamenta Informaticae, 2009 We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 symbols, and 2 states and 13 symbols, respectively. These machines are semi-weakly universal which means that on one side of the input they have an infinitely repeated word, and on the other side there is the usual infinitely repeated blank
Damien Woods, Turlough Neary
openalex +4 more sources
Four Small Universal Turing Machines [PDF]
Fundamenta Informaticae, 2009 We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known single-tape universal Turing machines with 5, 4, 3 and 2-symbols, respectively.
Turlough Neary, Damien Woods
+7 more sources
The Universal Turing Machine [PDF]
, 1972 The notion of the universal V-Turing machine is introduced and the thesis of Turing is reformulated.
Jacques Loeckx
openalex +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
The complexity of small universal Turing machines: A survey [PDF]
Theoretical Computer Science, 2008 We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing ...
Damien Woods, Turlough Neary
openalex +10 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
A Thermodynamically Universal Turing Machine
, 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 +4 more sources
Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA [PDF]
J R Soc Interface, 2017 Andrew Currin +6 more
openalex +2 more sources
Measurement-Based Quantum Turing Machines and their Universality
, 2004 13 pages, based upon quant-ph/0402156 with significant ...
Simon Perdrix, Philippe Jorrand
openalex +4 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