Results 21 to 30 of about 132,919 (197)
Verifying Time Complexity of Deterministic Turing Machines [PDF]
, 2014 We show that, for all reasonable functions $T(n)=o(n\log n)$, we can algorithmically verify whether a given one-tape Turing machine runs in time at most $T(n)$. This is a tight bound on the order of growth for the function $T$ because we prove that, for $
Gajser, David
core +1 more source
Local Transition Functions of Quantum Turing Machines [PDF]
, 2000 Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function.
Nishimura, Harumichi, Ozawa, Masanao
core +2 more sources
Undecidability and Complexity for Super-Turing Models of Computation
Proceedings, 2022 It seems that intelligent complex systems will require formalisms having richer behavior than Turing machines. Very little is known about the relations (e.g., the expressiveness and/or effectiveness) between new super-Turing models of computation.
Eugene Eberbach
doaj +1 more source
Addressing Machines as models of lambda-calculus [PDF]
Logical Methods in Computer Science, 2022 Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the $\lambda$-calculus has played a central role in this domain as it allows to focus on the notion of functional ...
Giuseppe Della Penna +2 more
doaj +1 more source
Going beyond Church–Turing Thesis Boundaries: Digital Genes, Digital Neurons and the Future of AI
Proceedings, 2020 The Church–Turing thesis deals with computing functions that are described by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, etc.
Rao Mikkilineni
doaj +1 more source
Computability and human symbolic output [PDF]
, 2013 This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on.
Megill, Jason, Melvin, Tim
core +4 more sources
The Turing Machine on the Dissecting Table
Teorie vědy, 2013 THE TURING MACHINE ON THE DISSECTING TABLE Abstract: Since the beginning of the twenty-first century there has been an increasing awareness that software rep- resents a blind spot in new media theory.
Jana Horáková
doaj +1 more source
An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles [PDF]
, 2016 We introduce an abstract analogue-digital model of computation that couples Turing machines to oracles that are physical processes. Since any oracle has the potential to boost the computational power of a Turing machine, the effect on the power of the ...
CG Hempel +4 more
core +1 more source
On the Proper Treatment of Dynamics in Cognitive Science
Topics in Cognitive Science, EarlyView., 2023 Abstract This essay examines the relevance of dynamical ideas for cognitive science. On its own, the mere mathematical idea of a dynamical system is too weak to serve as a scientific theory of anything, and dynamical approaches within cognitive science are too rich and varied to be subsumed under a single “dynamical hypothesis.” Instead, after first ...
Randall D. Beer
wiley +1 more source
Turing Machine Approach To Runtime Software Adaptation
Computer Science, 2014 In this paper, the problem of applying changes to software at runtime is considered. The computability theory is used in order to develop a more general and programming-language-independent model of computation with support for runtime changes.
Jarosław Rudy
doaj +1 more source