A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Some small self-describing Turing machines

1998
*
Computer Science Journal of Moldova
*

Several small

doaj:236c9dcb3bee445d9f3aa94f5933218a
fatcat:ljx7uxgy4rb6rlgfswzyaw4xa4
*self*-*describing**Turing**machines*are constructed. The number of instructions varies from 275 to 206, depending on the chosen encoding principles. ... The previous Thatcher's result (2532 instructions of*self*-*describing**machine*in Wang's format) is essentially improved. ...##
###
Implementation of a Self-replicating Universal Turing Machine
[chapter]

2004
*
Alan Turing: Life and Legacy of a Great Thinker
*

The goal of this contribution is to

doi:10.1007/978-3-662-05642-4_10
fatcat:wy4cxgnn5jferjlokmczdxdmza
*describe*how a universal*Turing**machine*was embedded into a hardware system in order to verify the computational universality of a novel architecture. ... In such an architecture, every artificial "cell" contains a complete copy of the description of the*machine*, a redundancy that allows the introduction of the properties of*self*-repair and*self*-replication ... Section 5*describes*the detailed implementation of a*self*-replicating universal*Turing**machine*. A discussion of our results follows in the final section (Section 6). ...##
###
Lying, computers and self-awareness

2020
*
Kairos: Journal of Philosophy & Science
*

One that uses two

doi:10.2478/kjps-2020-0009
fatcat:lncxdk4finakxfvivekdh34rui
*Turing**Machines*. From there, I have argued that such a procedure cannot be implemented in a*Turing**Machine*alone. ... Contrary to Morris' claim, I have thus suggested that computers – as far as they are*Turing**Machines*– cannot lie. ... I now proceed to*describe*concretely what an analyzing*Turing**Machine*must do in search for evidence that another*machine*has lied. ...##
###
A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty", arXiv:0811.0463
[article]

2009
*
arXiv
*
pre-print

*Self*-computation, as

*described*in the paper, involves executing the uncertain

*Turing*

*machine*on a copy of a similar

*machine*running arbitrary "code". ... In section 2, page 5, the

*machine*used throughout the paper is

*described*as a "

*Turing*-complete"

*machine*based on the

*Turing*

*machine*. ...

##
###
Page 423 of Thought Vol. 61, Issue 243
[page]

1986
*
Thought
*

M, being the arrangement of the quadruples

*describing*the functioning of the*Turing**machine*(without repetitions) (Davis 56-57). ... We want to prove*self*-contradictory that a*machine*D will decide whether any*Turing**machine*computation will ever halt, given the description of the*machine*T(d7) and its tape t. ...##
###
Going beyond Computation and Its Limits: Injecting Cognition into Computing

2012
*
Applied Mathematics
*

In this paper we argue that cognition requires more than mere book-keeping provided by the

doi:10.4236/am.2012.331248
fatcat:opyqkkeerrfkboerrqitwzwa7q
*Turing**machines*and certain aspects of cognition such as*self*-identity,*self*-description,*self*-monitoring and ...*self*-management can be implemented using parallel extensions to current serial von-Neumann stored program control (SPC)*Turing**machine*implementations. ... In this paper, we*describe*an extension of the von Neumann stored program serial implementation of the*Turing**machine*network using the same abstractions of*self*-management and regulation that provide ...##
###
Going beyond Computation and Its Limits: Injecting Cognition into Computing

2012
*
Applied Mathematics
*

In this paper we argue that cognition requires more than mere book-keeping provided by the

doi:10.4236/am.2012.311248
fatcat:zatcvt4lpbht3e3d52etmjo46i
*Turing**machines*and certain aspects of cognition such as*self*-identity,*self*-description,*self*-monitoring and ...*self*-management can be implemented using parallel extensions to current serial von-Neumann stored program control (SPC)*Turing**machine*implementations. ... In this paper, we*describe*an extension of the von Neumann stored program serial implementation of the*Turing**machine*network using the same abstractions of*self*-management and regulation that provide ...##
###
Page 5638 of Mathematical Reviews Vol. , Issue 2004g
[page]

2004
*
Mathematical Reviews
*

of several

*self*-*describing**Turing**machines*, namely*self*-*describing**machines*with, respectively, 350, 267, 224 and 206 instructions.” 20042:68037 68Q05 03D10 Margenstern, Maurice (F-METZ-ITA; Metz); Pavlotskaia ... Rudeanu (Bucharest) 2004¢:68036 68Q05 03D10 Margenstern, Maurice (F-METZT; Metz); Rogozhin, Yurii (MO-AOS-MI; Chisinau)*Self*-*describing**Turing**machines*. (English summary) Fund. ...##
###
Going beyond Church–Turing Thesis Boundaries: Digital Genes, Digital Neurons and the Future of AI

2020
*
Proceedings (MDPI)
*

The second is to search for computing models that solve problems that no ordinary

doi:10.3390/proceedings47010015
fatcat:pbjz5fm2kffgro4gr7quz6yg4q
*Turing**machine*can solve using superrecursive algorithms. ... The Church–*Turing*thesis deals with computing functions that are*described*by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, ... They are shown to simulate*Turing**machines*and inductive*Turing**machines*and are also proved to be more efficient than*Turing**machines*. ...##
###
Going beyond Church–Turing Thesis Boundaries: Digital Genes, Digital Neurons and the Future of AI

2020
*
Proceedings (MDPI)
*

The second is to search for computing models that solve problems that no ordinary

doi:10.3390/proceedings2020047015
fatcat:fvbglxmt2jhk7gnv5tuntrw7ve
*Turing**machine*can solve using superrecursive algorithms. ... The Church–*Turing*thesis deals with computing functions that are*described*by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, ... They are shown to simulate*Turing**machines*and inductive*Turing**machines*and are also proved to be more efficient than*Turing**machines*. ...##
###
The emperor's new mind

1990
*
Science of Computer Programming
*

Now, of all numbers x which number

doi:10.1016/0167-6423(90)90050-n
fatcat:wt3q4h7pnfbw7h2mdhyo7kvou4
*Turing**machines*, some will number*Turing**machines*that converge on*self*-input, and others will number*Turing**machines*that diverge on*self*-input. ... What the above argument purports to show is that, in determining whether*Turing**machines*halt on*self*-input, the human mind transcends the power of any*Turing**machine*because it can see of any*Turing**machine*...##
###
Computing Models for Distributed Autonomic Clouds and Grids in the Context of the DIME Network Architecture

2012
*
2012 IEEE 21st International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
*

*Turing*

*machine*... $calculus, Inductive

*Turing*

*Machines*, Infinite Time

*Turing*

*Machines*, Accelerating

*Turing*

*Machines*, Evolutionary

*Turing*

*Machines*and Evolutionary Automata [8, 9, 30] . ...

##
###
P-immune sets with holes lack self-reducibility properties

2003
*
Theoretical Computer Science
*

No P-immune set having exponential gaps is positive-

doi:10.1016/s0304-3975(02)00576-5
fatcat:qn3obn37t5exzcjp2hjvqedssm
*Turing**self*-reducible. ... Since SAT is positive-*Turing**self*-reducible (even disjunctive-*Turing**self*-reducible), there exists a deterministic polynomial-time*machine*M such that (1) SAT = L(M SAT ), (2) on each input x, M A (x) ... A set B is emptiness-testable if and only if M be a deterministic polynomial-time*Turing**machine*witnessing the*Turing*worddecreasing-*self*-reducibility of A. ...##
###
Mechanical Computing: The Computational Complexity of Physical Devices
[chapter]

2017
*
Encyclopedia of Complexity and Systems Science
*

Bibliography Glossary Mechanism: a

doi:10.1007/978-3-642-27737-5_325-4
fatcat:gwhg74q6sfas3ijoldk2ipuc4i
*machine*or part of a*machine*that performs a particular task computation: the use of a computer for calculation. ... In particular the bottom-up*self*-assembly processes*described*above have unique applications at the molecular scale. •*Self*-assembled DNA nanostructures. ... A number of the particle-based mechanical*machines*to be*described*are known to simulate cellular automata. • Randomized*Turing**machines*. The*machine*can make random choices in its computation. ...##
###
Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation

2011
*
Scientific Annals of Computer Science
*

absent from the literature on biomolecular computing; to partially redress this absence, we introduce a model of computation that is evidently programmable, by programs reminiscent of low-level computer

doaj:f1c82c941e7f444198c07a90ec5a33ea
fatcat:vpeanwdoqfg7dn5ti2so3a5rce
*machine*... functions can be computed (in natural ways and without arcane encodings of data and algorithm); it is also uniform: new "hardware" is not needed to solve new problems; and (last but not least) it is*Turing*... A.3 Compiling a*Turing**machine*into a blob program We*describe*a way to compile any*Turing**machine*Z = ({0, 1}, Q, δ, q start , q halt ) into blob program code code(Z) that simulates it. ...
« Previous

*Showing results 1 — 15 out of 53,539 results*