Results 211 to 220 of about 2,960,567 (255)
Some of the next articles are maybe not open access.
Universal Length Generalization with Turing Programs
arXiv.orgLength generalization refers to the ability to extrapolate from short training sequences to long test sequences and is a challenge for current large language models. While prior work has proposed some architecture or data format changes to achieve length
Kaiying Hou +4 more
semanticscholar +1 more source
2005
Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈Π20) computational power (as noise level tends to 0) is obtained. From a probabilistic standpoint this is a theory of large deviations for Turing machines.
Eugene Asarin, Pieter Collins
openaire +2 more sources
Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈Π20) computational power (as noise level tends to 0) is obtained. From a probabilistic standpoint this is a theory of large deviations for Turing machines.
Eugene Asarin, Pieter Collins
openaire +2 more sources
Cybernetics and Systems Analysis, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A NOTE ON REBOUND TURING MACHINES
International Journal of Foundations of Computer Science, 2004This paper continues the investigation of rebound Turing machines (RTM's). We first investigate a relationship between the accepting powers of simple one-way 2-head finite automata and simultaneously space-bounded and leaf-size bounded alternating RTM's, and show that for any functions L(n) and Z(n) such that L(n)Z(n)=o( log n) and [Formula: see text],
Katsushi Inoue +4 more
openaire +2 more sources
2017
A model of computation, the so-called inductive Turing machine, is introduced. In this model, a process of ''computation'' is not required to halt for giving the result. The ''computation capacity'' of inductive T- machines is shown to be strictly stronger than that of usual Turing machines.
openaire +2 more sources
A model of computation, the so-called inductive Turing machine, is introduced. In this model, a process of ''computation'' is not required to halt for giving the result. The ''computation capacity'' of inductive T- machines is shown to be strictly stronger than that of usual Turing machines.
openaire +2 more sources
Journal of Logic, Language and Information, 2000
Turing's celebrated 1950 paper proposes a very general methodological criterion for modelling mental function: total functional equivalence and indistinguishability. His criterion gives rise to a hierarchy of Turing Tests, from subtotal (“toy”) fragments of our functions (t1), to total symbolic (pen-pal) function (T2 – the standard Turing Test), to ...
openaire +1 more source
Turing's celebrated 1950 paper proposes a very general methodological criterion for modelling mental function: total functional equivalence and indistinguishability. His criterion gives rise to a hierarchy of Turing Tests, from subtotal (“toy”) fragments of our functions (t1), to total symbolic (pen-pal) function (T2 – the standard Turing Test), to ...
openaire +1 more source
Intuitionists Are Not (Turing) Machines
Philosophia Mathematica, 1995The author takes up that part of the debate on the mechanisability of our mind which is related to the effect of Gödel's incompleteness theorems on this problem and which argues that this theorem rules out any purely mechanical model of the human intellect.
openaire +2 more sources
Dynamic Neural Turing Machine with Continuous and Discrete Addressing Schemes
Neural Computation, 2018Çaglar Gülçehre +3 more
semanticscholar +1 more source
On the Impact of Turing Machines
2012Turing contributed a simple model of computation that has become the definition of computable. A function is considered to be computable if and only if it is computable on Turing's model of computation. Since our notion of computable is informal and Turing's model gives a precise definition of computable, we cannot prove the two equivalent.
openaire +1 more source