Results 11 to 20 of about 2,596,832 (272)
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 ...
Given-Wilson, Thomas
core +7 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
Anthony K. Seda +4 more
core +3 more sources
A mechanical Turing machine: blueprint for a biomolecular computer [PDF]
Interface Focus, 2012 We describe a working mechanical device that embodies the theoretical computing machine of Alan Turing, and as such is a universal programmable computer. The device operates on three-dimensional building blocks by applying mechanical analogues of polymer
E. Shapiro
semanticscholar +2 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).
Bianca Truthe +17 more
core +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
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
Automatic Student Engagement in Online Learning Environment Based on Neural Turing Machine
, 2021 With the continuous and rapid growth of online courses, online learners’ engagement recognition has become a novel research topic in the field of computer vision and pattern recognition.
Ma Xiaoyang, Min Xu, Dong Yao, Sun Zhong
semanticscholar +1 more source
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
How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem
Cryptography, 2022 The Panopticon (which means “watcher of everything”) is a well-known prison structure of continuous surveillance and discipline studied by Bentham in 1785. Today, where persistent, massive scale, surveillance is immensely facilitated by new technologies,
Vasiliki Liagkou +3 more
doaj +1 more source