Results 21 to 30 of about 2,596,832 (272)
The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable [PDF]
Logical Methods in Computer Science, 2021 Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it is equivalent to the behaviour of a (finite) reactive Turing machine.
Bas Luttik, Fei Yang
doaj +1 more source
Turing Tests with Turing Machines [PDF]
EPiC Series in Computing, 2018 Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference.Motivated by recent findings and developments in the area of machine intelligence evaluation, we discuss what it would be like ...
David L. Dowe +3 more
openaire +2 more sources
Some undecidable problems about the trace-subshift associated to a Turing machine [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We consider three problems related to dynamics of one-tape Turing machines: Existence of blocking configurations, surjectivity in the trace, and entropy positiveness. In order to address them, a reversible two-counter machine is simulated by a reversible
Anahí Gajardo +2 more
doaj +1 more source
Self-Reproducing Coins as Universal Turing Machine [PDF]
DPM/CBT@ESORICS, 2018 Turing-completeness of smart contract languages in blockchain systems is often associated with a variety of language features (such as loops). On the contrary, we show that Turing-completeness of a blockchain system can be achieved through unwinding the ...
A. Chepurnoy, Vasily Kharin, D. Meshkov
semanticscholar +1 more source
Quaternionic quantum Turing machines
Frontiers in Physics, 2023 Quaternionic quantum theory is an extension of the standard complex quantum theory. Inspired by this, we study the quaternionic quantum computation using quaternions.
Songsong Dai
doaj +1 more source
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation [PDF]
Symposium on the Theory of Computing, 2017 The field of algorithmic self-assembly is concerned with the computational and expressive power of nanoscale self-assembling molecular systems. In the well-studied cooperative, or temperature 2, abstract tile assembly model it is known that there is a ...
Pierre-Etienne Meunier, D. Woods
semanticscholar +1 more source
A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory [PDF]
Complex Systems, 2016 Since the definition of the Busy Beaver function by Rado in 1962, an interesting open question has been the smallest value of n for which BB(n) is independent of ZFC set theory. Is this n approximately 10, or closer to 1,000,000, or is it even larger? In
Adam B. Yedidia, S. Aaronson
semanticscholar +1 more source
2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023 CVPR 2023 camera-ready ...
Ryoo, Michael S. +8 more
openaire +2 more sources
Molecular system for an exponentially fast growing programmable synthetic polymer
Scientific Reports, 2023 In this paper, we demonstrate a molecular system for the first active self-assembly linear DNA polymer that exhibits programmable molecular exponential growth in real time, also the first to implement “internal” parallel insertion that does not rely on ...
Nadine Dabby, Alan Barr, Ho-Lin Chen
doaj +1 more source
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