Results 11 to 20 of about 76,455 (141)
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
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
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
Answering Subcognitive Turing Test Questions: A Reply to French [PDF]
, 2001 Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the network of cultural and perceptual associations that humans naturally ...
Turney, Peter
core +6 more sources
On the generating power of regularly controlled bidirection grammars [PDF]
, 1991 RCB-grammars or regularly controlled bidirectional grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion. In addition, the application of these\ud rules is controlled by a regular language.
Asveld, P.R.J. +2 more
core +3 more sources
Explaining the undecidability of first-order logic
Zagadnienia Filozoficzne w NauceTuring proved the unsolvability of the decision problem for first-order logic (Entscheidungsproblem) in his famous paper On Computable Numbers, with an Application to the Entscheidungsproblem.
Timm Lampert, Anderson Nakano
doaj +1 more source
Quantum Ballistic Evolution in Quantum Mechanics: Application to Quantum Computers
, 1996 Quantum computers are important examples of processes whose evolution can be described in terms of iterations of single step operators or their adjoints. Based on this, Hamiltonian evolution of processes with associated step operators $T$ is investigated
A. Barenco +39 more
core +1 more source
Model Theoretic Complexity of Automatic Structures [PDF]
, 2008 We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees).
Khoussainov, Bakhadyr, Minnes, Mia
core +3 more sources
The physical Church-Turing thesis and the principles of quantum theory [PDF]
, 2011 Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory. Yet several works have shown how quantum theory as it stands could breach the physical Church-Turing thesis.
Arrighi, Pablo, Dowek, Gilles
core +6 more sources
Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time [PDF]
, 2013 We describe a computational model for studying the complexity of self-assembled structures with active molecular components. Our model captures notions of growth and movement ubiquitous in biological systems.
Chen, Ho-Lin +5 more
core +4 more sources