Results 1 to 10 of about 134,383 (239)
An Intensional Concurrent Faithful Encoding of Turing Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary ...
Thomas Given-Wilson
doaj +8 more sources
A Concrete View of Rule 110 Computation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Rule 110 is a cellular automaton that performs repeated simultaneous updates of an infinite row of binary values. The values are updated in the following way: 0s are changed to 1s at all positions where the value to the right is a 1, while 1s are changed
Matthew Cook
doaj +4 more sources
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 +4 more sources
Not All the Bots Are Created Equal: The Ordering Turing Test for the Labeling of Bots in MMORPGs [PDF]
Social Media + Society, 2017 This article contributes to the research on bots in Social Media. It takes as its starting point an emerging perspective which proposes that we should abandon the investigation of the Turing Test and the functional aspects of bots in favor of studying ...
Stefano De Paoli
doaj +3 more sources
On capabilities of quantum-mechanical computer models [PDF]
Tehnika, 2022 The work includes the analyses of the theoretical capabilities of quantum-mechanical versus classical computer models in terms of their universality, their application domain, their efficacy in solving the problems and their technological feasibility ...
Simonović Svetomir I.
doaj +1 more source
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) [PDF]
Logical Methods in Computer Science, 2023 Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality (existence of
Andrej Dudenhefner
doaj +1 more source
A mechanical Turing machine: blueprint for a biomolecular computer. [PDF]
Interface Focus, 2012 Shapiro E.
europepmc +3 more sources
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics [PDF]
Logical Methods in Computer Science, 2023 The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive
Jos C. M. Baeten +2 more
doaj +1 more source
Reactive Turing machines [PDF]
Information and Computation, 2011 We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and ...
Baeten, J.C.M. +2 more
openaire +10 more sources
A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract- [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine ...
Nachum Dershowitz, Evgenia Falkovich
doaj +1 more source