A theory of consciousness from a theoretical computer science perspective: Insights from the Conscious Turing Machine. [PDF]
Proc Natl Acad Sci U S A, 2022 Significance This paper provides evidence that a theoretical computer science (TCS) perspective can add to our understanding of consciousness by providing a simple framework for employing tools from computational complexity theory and machine learning ...
Blum L, Blum M.
europepmc +3 more sources
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
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
Shapiro E.
europepmc +2 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
Problems in number theory from busy beaver competition [PDF]
Logical Methods in Computer Science, 2015 By introducing the busy beaver competition of Turing machines, in 1962, Rado defined noncomputable functions on positive integers. The study of these functions and variants leads to many mathematical challenges.
Pascal Michel
doaj +4 more sources
Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA [PDF]
Journal of the Royal Society Interface, 2017 Andrew Currin +2 more
exaly +2 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