Results 11 to 20 of about 23,795 (258)
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 +4 more sources
This research revisits the classic Turing test and compares recent large language models such as ChatGPT for their abilities to reproduce human-level comprehension and compelling text generation. Two task challenges- summary and question answering- prompt ChatGPT to produce original content (98-99%) from a single text entry and sequential questions ...
Noever, David, Ciolino, Matt
openaire +2 more sources
Turing Tests with Turing Machines [PDF]
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 ...
David L. Dowe+3 more
openaire +2 more sources
A Turing test for crowds [PDF]
The accuracy and believability of crowd simulations underpins computational studies of human collective behaviour, with implications for urban design, policing, security and many other areas. Accuracy concerns the closeness of the fit between a simulation and observed data, and believability concerns the human perception of plausibility. In this paper,
Jamie Webster, Martyn Amos
openaire +7 more sources
Turing Tumble is Turing-Complete
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 +2 more sources
Reactive Turing machines [PDF]
We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and ...
Baeten, J.C.M.+2 more
openaire +11 more sources
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
Mitochondria produce high amounts of ATP to power myosin motors and sustained muscle contraction. Here, the authors show that during development, muscles coordinate the morphogenesis of their myofibrils directly with their mitochondria to optimize both ...
Jerome Avellaneda+6 more
doaj +1 more source
Alan Turing y los orígenes de la eliminación gaussiana moderna
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
Cryptocurrency trading: a comprehensive survey
In recent years, the tendency of the number of financial institutions to include cryptocurrencies in their portfolios has accelerated. Cryptocurrencies are the first pure digital assets to be included by asset managers.
Fan Fang+6 more
doaj +1 more source