Results 31 to 40 of about 2,596,832 (272)
Zigzags in Turing Machines [PDF]
, 2010 We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of realtime recognition. We emphasize the class of one-head machines whose subshift can be recognized by a deterministic pushdown automaton.
Pierre Guillon, Anahí Gajardo
openaire +3 more sources
Features requirement elicitation process for designing a chatbot application
IET Networks, EarlyView., 2022 This article seeks to assist the chatbot community by outlining the characteristics that a chatbot needs to possess and explaining how to create a chatbot for a bank. In order to determine which capabilities are most crucial to ending users, a study of a small sample of chatbot users was conducted.
Nurul Muizzah Johari +4 more
wiley +1 more source
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
Reflector – A Dynamic Manifestation of Turing Machines with Time and Space Complexity Analysis
JISR on Computing, 2013 The Turing Machine model has proven to be capable of simulating every known computational model. Since its inception the model has served as the basis on which computational devices have been constructed.
Behroz Mirza, Muhammad Rafi
doaj +1 more source
Testing technology for tensile properties of metal materials based on deep learning model
Frontiers in Neurorobotics, 2022 The properties of metallic materials have been extensively studied, and nowadays the tensile properties testing techniques of metallic materials still have not found a suitable research method.
Xuewen Chen, Weizhong Fan, Weizhong Fan
doaj +1 more source
The Accidental Philosopher and One of the Hardest Problems in the World
Philosophies, 2022 Given the difficulties of defining “machine” and “think”, Turing proposed to replace the question “Can machines think?” with a proxy: how well can an agent engage in sustained conversation with a human?
Sonje Finnestad, Eric Neufeld
doaj +1 more source
The Ghost in the Quantum Turing Machine [PDF]
The Once and Future Turing, 2013 In honor of Alan Turing's hundredth birthday, I unwisely set out some thoughts about one of Turing's obsessions throughout his life, the question of physics and free will. I focus relatively narrowly on a notion that I call "Knightian freedom": a certain
S. Aaronson
semanticscholar +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
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
Mathematics in the age of the Turing machine [PDF]
Turing's Legacy, 2013 The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.
T. Hales
semanticscholar +1 more source