Small universal Turing machines

From MaRDI portal
Revision as of 14:01, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1349852

DOI10.1016/S0304-3975(96)00077-1zbMath0874.68106OpenAlexW2065105492WikidataQ56112365 ScholiaQ56112365MaRDI QIDQ1349852

Yurii Rogozhin

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00077-1




Related Items (47)

The Complexity of Small Universal Turing Machines: A SurveyInteger weighted automata on infinite wordsUniversality in Molecular and Cellular ComputingAbstract geometrical computation. VIII: Small machines, accumulations \& rationalitySmall Universal DevicesAbstract geometrical computation. IV: Small Turing universal signal machinesOn the complex behavior of simple tag systems -- an experimental approachSmall networks of polarized splicing processors are universalAn automaton group with undecidable order and Engel problemsDirect constructions of universal extended H systems.Small Universal Reversible Counter MachinesInteger Weighted Automata on Infinite WordsMorphogenetic computing: computability and complexity resultsSpiking neural P systems with polarizations and rules on synapsesSpiking neural P systems with rules on synapsesThe laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solvedReversible computing and cellular automata -- a surveyEncodings of Turing machines in linear logicThree small universal spiking neural P systemsA DNA computing inspired computational modelOn the computational power of networks of polarized evolutionary processorsTag systems and Collatz-like functionsUnnamed ItemA survey of computational complexity results in systems and controlBoundedness of the Domain of Definition is Undecidable for Polynomial ODEsON SMALL UNIVERSAL SPLICING SYSTEMSSmall universal accepting hybrid networks of evolutionary processorsSmall Turing machines and generalized busy beaver competitionUniversal Petri netReal recursive functions and their hierarchyAnalog computation beyond the Turing limitHow Redundant Is Your Universal Computation Device?Small fast universal Turing machinesThe complexity of small universal Turing machines: A surveySMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMSA new conceptual framework for analog computationAverage-Case Completeness in Tag SystemsClosed-form analytic maps in one and two dimensions can simulate universal Turing machinesSurprising Areas in the Quest for Small Universal DevicesMaurice Margenstern’s Contributions to the Field of Small Universal Turing MachinesComputational bounds on polynomial differential equationsDNA computing based on splicing: Universality resultsFrontier between decidability and undecidability: A surveyThe stability of the deterministic Skorokhod problem is undecidableA Note on Computation MTs with Time in Instructions or with Tapes of Fixed LengthComputing by Floating StringsComputational universality and efficiency in morphogenetic systems




Cites Work




This page was built for publication: Small universal Turing machines