Results 11 to 20 of about 284,160 (268)
An Intensional Concurrent Faithful Encoding of Turing Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary ...
Thomas Given-Wilson
doaj +8 more sources
Bulletin of Mathematical Biology, 2021 AbstractReaction–diffusion systems are an intensively studied form of partial differential equation, frequently used to produce spatially heterogeneous patterned states from homogeneous symmetry breaking via the Turing instability. Although there are many prototypical “Turing systems” available, determining their parameters, functional forms, and ...
Woolley, TE, Krause, AL, Gaffney, EA
openaire +5 more sources
Filozofia i Nauka, 2023 We examine Turing’s intriguing claim, made in the philosophy journal Mind, that he had created a short computer program of such a nature that it would be impossible “to discover by observation sufficient about it to predict its future behaviour, and this within a reasonable time, say a thousand years” (Turing, 1950, p. 457).
B. Jack Copeland, Diane Proudfoot
openaire +2 more sources
International Journal of Philosophy Study, 2016 Many important lines of argumentation have been presented during the last decades claiming that machines cannot think like people. Yet, it has been possible to construct devices and information systems, which replace people in tasks which have previously been occupied by people as the tasks require intelligence.
Saariluoma, Pertti, Rauterberg, Matthias
openaire +4 more sources
Turing Tumble is Turing-Complete
Theoretical Computer Science, 2023 It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, is Turing-Complete. This is achieved via direct simulation of a Turing machine. Unlike previously informally presented constructions, we do not encode the finite control infinitely many times, we need only one trigger/ball-hopper
openaire +3 more sources
Notre Dame Journal of Formal Logic, 1987 A number-theoretic function f is called ``Turing projectable'' if there is a Turing computable function g such that for each fixed n, g(n,m) is constant for sufficiently large m, and \(f(n)=\lim_{m\to \infty}g(n,m)\). Some elementary recursion-theoretic properties of this notion are derived, for example that the Turing projectable functions are exactly
McCarthy, Timothy, Shapiro, Stewart
openaire +2 more sources
On the time complexity of 2-tag systems and small universal Turing machines [PDF]
, 2006 We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing machines in polynomial time.
Neary, Turlough, Woods, Damien
core +2 more sources
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
Alan Turing y los orígenes de la eliminación gaussiana moderna
Arbor: Ciencia, Pensamiento y Cultura, 2013 La resolución de sistemas de ecuaciones lineales es sin duda el problema más importante en Matemática Aplicada. Es importante en sí mismo y también porque es un paso intermedio en la resolución de muchos otros problemas de gran relevancia. La eliminación
Froilán M. Dopico
doaj +1 more source
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