Results 21 to 30 of about 2,960,567 (255)
A Small Universal Petri Net [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is exponential in the ...
Dmitry A. Zaitsev
doaj +1 more source
A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory [PDF]
Complex Systems, 2016 Since the definition of the Busy Beaver function by Rado in 1962, an interesting open question has been the smallest value of n for which BB(n) is independent of ZFC set theory. Is this n approximately 10, or closer to 1,000,000, or is it even larger? In
Adam B. Yedidia, S. Aaronson
semanticscholar +1 more source
2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023 CVPR 2023 camera-ready ...
Michael S. Ryoo +8 more
openaire +2 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
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
Turing Tests with Turing Machines
EPiC Series in Computing, 2018 Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference.Motivated by recent findings and developments in the area of machine intelligence evaluation, we discuss what it would be like ...
José Hernández-Orallo +3 more
openaire +2 more sources
Turing Automata and Graph Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras.
Miklós Bartha
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
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