Results 31 to 40 of about 2,960,567 (255)
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
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.
Anahí Gajardo, Pierre Guillon 0001
openaire +2 more sources
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
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
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
Formalizing Turing Machines [PDF]
, 2012 We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece in our Reverse Complexity program, aiming to a comfortable ...
ASPERTI, ANDREA, RICCIOTTI, WILMER
openaire +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
CoRR, 2021 We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.
openaire +2 more sources
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