Results 11 to 20 of about 2,083,882 (139)
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
The Turing Way: A handbook for reproducible, ethical and collaborative research
, 2022 The Turing Way is an open source community-driven guide to reproducible, ethical, inclusive and collaborative data science. The Turing Way book is collaboratively developed by its diverse community of researchers, learners, educators, and other ...
The Turing Way Community
core +1 more source
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
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
Illustrations from The Turing Way: Shared under CC-BY 4.0 for reuse
, 2023 Illustrations created by Scriberia as part of the Turing Way book dashes and illustration sprints in 2019 (two events in person), 2020 (one event in-person and one online), 2021 (two online), 2022 (Turing-Crick partnership project hybrid sprint, one Book
The Turing Way Community, Scriberia
core +1 more source
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 +1 more source
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
Local Search and the Evolution of World Models
Topics in Cognitive Science, EarlyView., 2023 Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley +3 more
wiley +1 more source