Results 11 to 20 of about 20,918 (155)

Reachability for infinite time Turing machines with long tapes [PDF]

, 2020
Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells cannot be halting
Carl, Merlin, Rin, Benjamin, Schlicht, Philipp   +2 more
core   +6 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, Puteri N. E. Nohuddin, Ahmad Hanif Ahmad Baharin, Noor Azuddin Yakob, Mohammad Javad Ebadi   +4 more
wiley   +1 more source

Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals [PDF]

, 2009
We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the application of
Coskey, Samuel, Hamkins, Joel David
core   +1 more source

Strong Turing Degrees for Additive BSS RAM's [PDF]

, 2013
For the additive real BSS machines using only constants 0 and 1 and order tests we consider the corresponding Turing reducibility and characterize some semi-decidable decision problems over the reals.
Gaßner, Christine
core   +2 more sources

On the necessity of complexity [PDF]

, 2012
Wolfram's Principle of Computational Equivalence (PCE) implies that universal complexity abounds in nature. This paper comprises three sections. In the first section we consider the question why there are so many universal phenomena around.
C.H. Bennett, C.S. Calude, I. Pitowsky, J.J. Joosten, M. Agrawal, R. Dawkins   +5 more
core   +1 more source

The prospects for mathematical logic in the twenty-first century [PDF]

, 2001
The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed ...
Alexander S. Kechris, Anand Pillay, Richard A, Richard A. Shore, Samuel R. Buss   +4 more
core   +3 more sources

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

A Survey on Continuous Time Computations [PDF]

, 2007
We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models.
A Ben-Hur, A Ben-Hur, A Ben-Hur, A Ben-Hur, A Kempe, A Rabinovich, A Turing, A Vergis, A. Church, APL Francisco, Asarin, B Trakhtenbrot, BJ Copeland, C Moore, C Moore, C Moore, C Moore, CE Shannon, CS Calude, D Dee, D Deutsch, D Graça, D Woods, DS Graça, DS Graça, E Asarin, E Asarin, E Asarin, E Post, EB Davies, G Etesi, G Lafferriere, G P ăun, H Abdi, HM Stoll, HT Siegelmann, HT Siegelmann, HT Siegelmann, I Artobolevskii, I Németi, J Earman, J Foy, J Mycka, J Mycka, J Mycka, J Mycka, J Šíma, J Šíma, JF Costa, JJ Hopfield, JJ Hopfield, JV Tucker, K Ruohonen, K Ruohonen, K Ruohonen, K Ruohonen, K Ruohonen, K Ruohonen, K Weihrauch, K-I Ko, K-I Ko, L Blum, L Faybusovich, L Faybusovich, L Lipshitz, LA Rubel, LA Rubel, LM Adleman, M Campagnolo, M Campagnolo, M Casey, M Casey, M Davis, M Gori, M Hogarth, M Hogarth, M Hoyrup, M Pour-El, MB Pour-El, MB Pour-El, MB Pour-El, MD Bowles, ML Campagnolo, ML Campagnolo, ML Hogarth, MO Rabin, MS Branicky, MS Branicky, N Müller, O Bournez, O Bournez, O Bournez, O Bournez, O Bournez, O. Finkel, P Bouyer, P Clote, P Collins, P Koiran, P Koiran, P Koiran, P Orponen, P Orponen, PW Shor, R Alur, R Alur, R Legenstein, RJ Lipton, RW Brockett, RW Brockett, S Aaronson, S Grigorieff, S Omohundro, S. C. Kleene, T Brihaye, T Brihaye, T Head, T Natschläger, TA Henzinger, TD Kieu, U Helmke, V Bush, VD Blondel, VD Blondel, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, WD Smith, Šíma   +138 more
core   +5 more sources

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, Bonan Zhao, Tadeg Quillien, Christopher G. Lucas   +3 more
wiley   +1 more source

Instruction sequence processing operators [PDF]

, 2012
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the behaviours produced by them under execution, the interaction between these ...
Bergstra, J. A., Middelburg, C. A.
core   +3 more sources