A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
We consider computations of a Turing machine subjected to noise. ... We construct a universal 1-tape Turing machine that for a low enough (constant) noise probability performs arbitrarily large computations. ... Here, we will use this construction to prove Theorem 1. 8.1 Fault estimation The theorem says that there is a Turing machine 𝑀1 that can reliably (in the deﬁned sense) simulate any other Turing machine ...arXiv:2112.02152v1 fatcat:ynbkwxqupveqlfst3prjojvujy
More speciÿcally, the Turing account con ates concepts that are crucial for understanding the computational capacities of physical machines. ... It is my contention that the plausibility of Turing's account as an analysis of the computational capacities of physical machines rests upon a number of highly problematic assumptions whose plausibility ... is not a Turing machine. ...doi:10.1016/j.tcs.2003.12.012 fatcat:7q5id3sonfdpzcftgfuw453taq
More speciÿcally, the Turing account con ates concepts that are crucial for understanding the computational capacities of physical machines. ... It is my contention that the plausibility of Turing's account as an analysis of the computational capacities of physical machines rests upon a number of highly problematic assumptions whose plausibility ... is not a Turing machine. ...doi:10.1016/s0304-3975(03)00639-x fatcat:xzff4ivpfvcqtjjjqeklzplgii
We propose an alternative to the Turing test that removes the inherent asymmetry between humans and machines in Turing's original imitation game. ... We also propose a small number of refinements to improve further the test. These refinements could be applied also to Turing's original imitation game. ... Note that to pass the test, we do not ask a machine to recognise reliably any machines that are themselves potentially passing the meta-Turing test. ...arXiv:2205.05268v1 fatcat:cwmjge5b3vfkpnu4nc6gpuq3nu
Three other papers on (deterministic) Turing machines complete the first two sections of the volume: C. E. Shannon, A universal Turing machine with two internal states, M. D. ... Davis, A note on uni- versal Turing machines, and John McCarthy, The inversion of functions defined by Turing machines. The third section, Synthesis of automata, contains four papers on ...
It is proved that a judgement with a computing time complexity of O(n) on an off-line Turing machine will need one of O(n?) if it is computed on a single-tape Turing machine. ... Summary: “The difference in the computing time between the off- line Turing machine and single-tape Turing machine is investigated. ...
of some sets of words by on-line Turing machines. ... Hennie established a lower bound of order n?/log? n for the on-line Turing machine recognition of a specific language A. ...
a machine. ... We suggest that Turing was introducing the novel idea that intelligence can be reliably evidenced in practice by finite interactions. ... To be clear, when Turing (1936) refers to a 'machine', he is referring to a Turing machine, or program, not a physical machine. ...dblp:conf/eapcogsci/MaguireMM15 fatcat:lgejp6nidvbuvm7wcxjr7sknya
In The Inversion of Functions Defined by Turing Machines, John McCarthy finds a simple Turing machine which, for given values of m andr, com putes a number z (if any exists) such that the mth Turing machine ... Davis contributes A Note on Universal Turing Machines which con tains a new definition of universal Turing machines and a proof that the encoding for such machines can actually be performed by computable ...
to which any function that is computable by a physical system is computable by a Turing machine. ... I then distinguish between bold formulations of Physical CT, according to which any physical process-anything doable by a physical system-is computable by a Turing machine, and modest formulations, according ... As Alan Turing (1950, (438) (439) pointed out, a machine with a -random element‖ can do -more‖ than a Turing machine. ...doi:10.1093/bjps/axr016 fatcat:domjnoyk6vbqfayfmze3azcx6a
The supposed simplicity concept is better perceived as a specific inductive assumption, the assumption of effectiveness. ... This article explicates the relevant argument and, by converting it into a Bayesian framework, reveals why it has no such justificatory force. ... If a Turing machine represents a particular computer program, a universal Turing machine represents a general-purpose computer. ...doi:10.1086/687257 fatcat:6mi2clbqfngbpfqlmrrduvw6sq
In this paper we analyze the computability of the reliability function and its related functions. We show that the reliability function is not a Turing computable performance function. ... The channel reliability function is an important tool that characterizes the reliable transmission of messages over communication channels. ... A Turing machine represents an algorithm or a program. ...arXiv:2101.09754v2 fatcat:maugzh7smbafzpisqffiflikie
Problems range from Godel-type questions (relating to Turing machines and decision procedures), to questions of duplication, of various biological phenomena in a machine (e.g., adaptation, self-reproduction ... It is an interdisciplinary science bordered mathematically by symbolic logic and Turing machine theory, bordered engineering-wise by the theory and the use, particularly for general non-numerical work, ... The situation is somewhat analogous to that of Turing machines and indeed there is a notion of a universal constructing machine which can, by proper programming, imitate any machine for construction purposes ...doi:10.1090/s0002-9904-1958-10214-1 fatcat:4gnq2ahya5hedaqnhrp6dh6gqe
As a guide to the condition of machine windings, insulation resistance should be periodically checked with a megohmmeter Clean Equipment Spells Reliability A “How-to-do-it” article on cleaning and treating ... elec- trical machinery windings to insure reliable operation By Arnold Benson Asst. ...
Let M denote a machine that is reliable on R. ... An oracle machine is a multi- tape Turing machine with a distinguished oracle tape and three distinguished states: query, yes and no. ...
« Previous Showing results 1 — 15 out of 52,205 results