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
universal Turing machine
[chapter]
2000
Computer Science and Communications Dictionary
Preserved Fulltext
After years of private research into the memory bus, we show the investigation of virtual machines, which embodies the private principles of networking. ...
While such a hypothesis might seem unexpected, it has ample historical precedence. network; (3) we measured instant messenger and instant messenger latency on our desktop machines; and (4) we asked (and ...
We these considerations in mind, we ran four novel experiments: (1) we dogfooded our heuristic on our own desktop machines, paying particular attention to hard disk speed; (2) we measured WHOIS and E-mail ...
doi:10.1007/1-4020-0613-6_20474
fatcat:ndujwa6d4fhyfhr66b4ae5gypy
Universal Turing Machine
[chapter]
1998
Associative Learning for a Robot Intelligence
Preserved Fulltext
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.
After years of private research into the memory bus, we show the investigation of virtual machines, which embodies the private principles of networking. ...
While such a hypothesis might seem unexpected, it has ample historical precedence. network; (3) we measured instant messenger and instant messenger latency on our desktop machines; and (4) we asked (and ...
We these considerations in mind, we ran four novel experiments: (1) we dogfooded our heuristic on our own desktop machines, paying particular attention to hard disk speed; (2) we measured WHOIS and E-mail ...
doi:10.1142/9781848160590_0006
fatcat:kptilindhbg5bjbl6x63blqlue
The universal turing machine interpreter
2016
Natsional'na Akademiya Nauk Ukrainy. Dopovidi: naukovyi zhurnal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The Universal Turing Machine
[chapter]
1972
Lecture notes in economics and mathematical systems
Preserved Fulltext
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.
After years of private research into the memory bus, we show the investigation of virtual machines, which embodies the private principles of networking. ...
While such a hypothesis might seem unexpected, it has ample historical precedence. network; (3) we measured instant messenger and instant messenger latency on our desktop machines; and (4) we asked (and ...
We these considerations in mind, we ran four novel experiments: (1) we dogfooded our heuristic on our own desktop machines, paying particular attention to hard disk speed; (2) we measured WHOIS and E-mail ...
doi:10.1007/978-3-642-80689-6_4
fatcat:aafpe2amrbfojl3hhijsbqxczy
Small universal Turing machines
1996
Theoretical Computer Science
Preserved Fulltext
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.
Let UTM(m,n) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist in the following classes: ...
Preliminaries: How to construct a universal Turing machine The universal Turing machines we define in the following sections simulate tagsystems. ...
A universal Turing machine U simulates a tag-system as follows. ...
doi:10.1016/s0304-3975(96)00077-1
fatcat:ajcsekzxznddrdjtn6flrvvpqy
A universal Turing machine
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
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.
After years of private research into the memory bus, we show the investigation of virtual machines, which embodies the private principles of networking. ...
While such a hypothesis might seem unexpected, it has ample historical precedence. network; (3) we measured instant messenger and instant messenger latency on our desktop machines; and (4) we asked (and ...
We these considerations in mind, we ran four novel experiments: (1) we dogfooded our heuristic on our own desktop machines, paying particular attention to hard disk speed; (2) we measured WHOIS and E-mail ...
doi:10.1007/3-540-56992-8_1
fatcat:swph562bpfdnpct7b3cof7qriu
Small Weakly Universal Turing Machines
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We refer to such universal machines as weakly universal Turing machines. ...
Universal Turing machines In this section we give the input encoding to our universal Turing machines. ...
To see this, compare the part of the Turing machine tape in bold with cells −7 to 0 of configuration c 1 in Figure 7 .2.1. We continue our simulation to give timestep c 1 ⊢ c 2 . ...
doi:10.1007/978-3-642-03409-1_24
fatcat:qm5hhofbxzbllbgbwlm32td3ny
Small weakly universal Turing machines
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). ...
They simulate Rule 110 and are currently the smallest known weakly universal Turing machines. ...
In 1961 Watanabe [24] gave a 6-state, 5-symbol universal Turing machine, the first weakly universal machine. In 1962, Minsky [11] found a small 7-state, 4-symbol universal Turing machine. ...
arXiv:0707.4489v1
fatcat:76xx3rfpmbg2temtx7whaxkhki
A Physically Universal Turing Machine
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We construct a two-dimensional Turing machine that is physically universal in both the moving tape and moving head model. In particular, it is mixing of all finite orders in both models. ...
We also provide a variant that is physically universal in the moving tape model, but not in the moving head model. ...
In this paper, we define a notion of physical universality for Turing machines in both models, and present a two-dimensional Turing machine that is efficiently physically universal in both models. ...
arXiv:2003.10328v1
fatcat:h7oq6v6v2rdqvaswxpdeiuhav4
Small fast universal Turing machines
2006
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of (3, 11), (5, 7), (6, 6), (7, 5) and (8, 4). ...
These are the smallest known UTMs that simulate Turing machines in polynomial time. ...
Introduction Shannon [13] first posed the question of finding the smallest possible universal Turing machine (UTM). ...
doi:10.1016/j.tcs.2006.06.002
fatcat:n6o7bvzgkngfjokbwgffw344cq
Small Turing universal signal machines
2009
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Other Versions
After presenting signal machines, it is shown how to get universal ones from Turing machines, cellular-automata and cyclic tag systems. ...
Finally a halting universal signal machine with 13 meta-signals and 21 collision rules is presented. ...
Acknowledgement We are very grateful to Matthew Cook for proposing the ghost signal trick which improved the bounds by one in the weak universal cases. ...
doi:10.4204/eptcs.1.7
fatcat:puuo6wsdtbhthkksxwdyqw2kz4
Beyond the universal Turing machine
1999
Australasian Journal of Philosophy
Preserved Fulltext
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.
According to the nonclassicist, the set of well-defined computations is not exhausted by the computations that can be carried out by a Turing machine. ...
A coupled Turing machine can calculate more than the universal Turing machine: an input stream makes all the difference. ...
machines can be simulated by a single universal Turing machine-which involves the idea of the universal machine interleaving the processing steps performed by the individual machines in the assembly-is ...
doi:10.1080/00048409912348801
fatcat:3g35dt4cfvg6joya3r6ohmkbly
A simplified universal Turing machine
1952
Proceedings of the 1952 ACM national meeting (Toronto) on - ACM '52
Preserved Fulltext
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.
Universal Turing Machine In addition to considering Turing machines which would perform various other mathematical operations, Turing gave a description ol a universal Turing machine, which was a single ...
UNIVERSAL
TURING
MACHINE
I~ 00eR -L,
__
..... ...
~8~K-O~ ~T/ WAS SHORTER
SIMPLE LEARNING BY A DIGITAL COMPUTER The Computation Laboratory Harvard University ...
doi:10.1145/800259.808993
fatcat:a63okcxwpfbglbsekonydywxdy
On quasi-unilateral universal Turing machines
2001
Theoretical Computer Science
Preserved Fulltext
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.
Four universal Turing machines are given with strong limitations on the number of left instructions in their program. ...
A unilateral Turing machine is a machine the instructions of which have all the same move but, possibly, halting instructions. Notice that we may choose that there is a single halting instruction. ...
Up to what extent is it necessary to remove unilaterality in order to obtain universal Turing machines? ...
doi:10.1016/s0304-3975(00)00114-6
fatcat:gvbjpb3n4jbr7jjjiy22a6ijkq
Deutsch's Universal Quantum Turing Machine (Revisited)
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Quantum Turing machines form a class closely related to deterministic and probabilistic Turing machines and one might hope to find a universal machine in this class. ...
Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. ...
quantum Turing machine. ...
arXiv:quant-ph/0701108v1
fatcat:bqzrekywdzg5ppz3jxxdwuk7iu
« Previous
Showing results 1 — 15 out of 120,401 results