Results 11 to 20 of about 1,568 (209)
Інформаційні технології і засоби навчання, 2016 The article discusses the importance of studying the notion of algorithm and its formal specification using Turing machines. In the article it was identified the basic hypothesis of the theory of algorithms for Turing as well as reviewed scientific ...
Oleksandr B. Yashchyk
doaj +1 more source
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 +8 more sources
Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA. [PDF]
J R Soc Interface, 2017 Currin A +6 more
europepmc +3 more sources
The definition of universal Turing machine [PDF]
Proceedings of the American Mathematical Society, 1957 Martin Davis
openalex +3 more sources
The universe as a thermal universal Turing machine
, 2017 I suggest and formalize an alternative approach to understand the universe in which a large blob of irreducible facts, rather than a small list of axioms, define the theory. The blob of facts is given a physical interpretation when it is structured as a Gibbs ensemble. In the case where the facts are logically verifiable, the Gibbs ensemble describes a
Alexandre Harvey-Tremblay
openalex +2 more sources
Utilizing Causal Network Markers to Identify Tipping Points ahead of Critical Transition. [PDF]
Adv Sci (Weinh)The study proposes a causal network markers (CNMs) framework to identify early‐warning signals preceding critical transitions. It validates CNMs on various computational benchmark models and real‐world datasets, demonstrating higher accuracy and flexibility compared to existing approaches.
Bian S, Wang Z, Leng S, Lin W, Shi J.
europepmc +2 more sources
A Small Universal Petri Net [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is exponential in the ...
Dmitry A. Zaitsev
doaj +1 more source
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 +1 more source
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 +1 more source
Four Small Universal Turing Machines [PDF]
Fundamenta Informaticae, 2007 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.
Neary, Turlough, Woods, Damien
openaire +2 more sources