The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 2219 of Mathematical Reviews Vol. , Issue 91D
[page]
1991
Mathematical Reviews
Preserved Fulltext
Jiirgensen (3-WON-C)
91d:68012 68Q05 03D10 68Q15 68Q30 Dietzfelbinger, Martin (D-PDRB) The speed of copying on one-tape off-line Turing machines. Inform. Process. Lett. 33 (1989), no. 2, 83-89. ...
An upper bound of O(d + sd/log(min(n, d))) is proved on the time required by a one-tape off-line deterministic Turing machine for copying a string of length s on its work tape across d cells when the input ...
The complexity of matrix transposition on one-tape off-line Turing machines
1991
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.
Further corollaries give the first non-linear lower bound for the version of the two-tapes-versus-one problem concerning one-tape off-line Turing machines, and separate one-tape off-line Turing machines ...
The proof of the matching upper bound (which is nontrivial for p < log 1) uses the fact that one-tape off-line Turing machines can copy strings slightly faster than if the straightforward method is used ...
Turing machines In this section we describe a trick that enables one-tape off-line Turing machine5 to copy strings from one place on the worktape to another a little faster than one would expect. ...
doi:10.1016/0304-3975(91)90175-2
fatcat:fkt4rvugerhqzinuaqpukhzqde
Two-Tape Simulation of Multitape Turing Machines
1966
Journal of the ACM
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 2012; you can also visit the original URL.
The file type is application/pdf.
On the other hand, the use of extra tapes does make it possible to speed up the computation of certain functions. ...
It has long been known that increasing the number of tapes used by a Turing machine does not provide the ability to compute any new functions. ...
Application to Off-Line Turing Machines An off-line Turing machine is a basic multitape Turing machine that has binary outputs associated with some of its states. ...
doi:10.1145/321356.321362
fatcat:yeawkwgysba43g4imgx2nz6cdu
Computation by assembly
1975
Journal of computer and system sciences (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 2017; you can also visit the original URL.
The file type is application/pdf.
SPEED/ERASURE TRADE-OFF The Turing machine's power-to-erase permits economies in its motion and raises the question to what extent the speed of computation of a Turing machine is degraded by an inability ...
Let J-= (Q, A, 7r) be a one-head, one-tape Turing machine, the alphabet of which is A = {% ,..., a,,} where a 0 is the blank symbol of Y. ...
doi:10.1016/s0022-0000(75)80054-7
fatcat:7hia6n6lcvck3kwhzaszoi7xdy
Page 460 of SMPTE Motion Imaging Journal Vol. 89, Issue 6
[page]
1980
SMPTE Motion Imaging Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The tape is then viewed on the right- hand picture monitor at various speeds, in either direction, and in still frame, as re- quired by the editor under the control of the light pen. ...
Transfer, comprising the transfer from electronic camera originals to off-line videotape copies for viewing and editing.
460 SMPTE Journal June 1980 Volume 89
Fig. 8. ...
One-tape, off-line Turing machine computations
1965
Information and Control
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 2013; you can also visit the original URL.
The file type is application/pdf.
The first is to investigate the characteristics of a restricted class of Turing machines, and to develop a simple tool for describing their computations. ...
The second is to present specific problems for which tight lower bounds can be found for the computation times required by Turing machines of this restricted class. ...
one-tape, off-line machine. ...
doi:10.1016/s0019-9958(65)90399-2
fatcat:qywg7zphuja4tlvclgsxdzql4u
The thermodynamics of computation—a review
1982
International Journal of Theoretical Physics
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 2016; you can also visit the original URL.
The file type is application/pdf.
in the limit of zero speed. ...
Converse to the rule that logically irreversible operations on data require an entropy increase elsewhere in the computer is the fact that a tape full of zeros, or one containing some computable pseudorandom ...
in Figure 7 , required to perform read, write, and shift operations on the Turing machine tape. ...
doi:10.1007/bf02084158
fatcat:cwcwum3phbdbtb25qpzxii7jvm
An algorithm to simulate alternating Turing machine in signal machine
[article]
2017
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.
In this paper we provide an algorithm to simulate Alternating Turing Machine in the context of Signal Machine using techniques adopted from the features of Signal Machine to set up and manage the copies ...
Depending on the computation tree space complexity is exponential order of d, where d is the depth of the computation tree. ...
Turing Machine and Signal Machine Turing Machine (TM) is one of the abstract classical models of computation which temporary stores the inputs on a tape. ...
arXiv:1708.09455v1
fatcat:op56xlkj5zeshds4bxhcneushi
A hierarchy for nondeterministic time complexity
1972
Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72
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.
The computing devices are nondeterministic multitape Turing machines. ...
We prove the following theorem in this paper: For any real numbers rl, r2, 1 ~ rl ~ r2, there is a set .4 of strings which has nondeterministic time complexity n*2, but not nondeterministic time complexity ...
A restricted Turing machine is a nondeterministic Turing machine with two read/write tapes. One of these serves as both an input tape and work tape, and one is just a work tape. ...
doi:10.1145/800152.804913
dblp:conf/stoc/Cook72
fatcat:gh2noucnpjegzlszskms7rdoem
A hierarchy for nondeterministic time complexity
1973
Journal of computer and system sciences (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 2017; you can also visit the original URL.
The file type is application/pdf.
The computing devices are nondeterministic multitape Turing machines. ...
We prove the following theorem in this paper: For any real numbers rl, r2, 1 ~ rl ~ r2, there is a set .4 of strings which has nondeterministic time complexity n*2, but not nondeterministic time complexity ...
A restricted Turing machine is a nondeterministic Turing machine with two read/write tapes. One of these serves as both an input tape and work tape, and one is just a work tape. ...
doi:10.1016/s0022-0000(73)80028-5
fatcat:4errebavb5hirb4rnywcso3ygy
Page 320 of SMPTE Motion Imaging Journal Vol. 100, Issue 4
[page]
1991
SMPTE Motion Imaging Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Its fea- tures include newly designed solvent strippers that allow operation speeds of up to 200 ft/min, almost twice the speed of conventional units. ...
Tape- chek D-211 provides the user with an ac- curate, reliable, and quanitifiable means of on-line evaluation for D-2 tapes. ...
Page 164 of American Bankers Association. ABA Banking Journal Vol. 52, Issue 8
[page]
1960
American Bankers Association. ABA Banking Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A NEW high-speed check signing This desk-model machine seals, machine that produces maximum stamps, and stacks letters in one disbursement protection has been announced by the Todd Company Di- Burroughs ...
Attitudes On and Off the Job de- Copies may be obtained from any scribes a tested means of employee local branch sales office or by writ- communication designed to help in- ing to Detroit 32, Michigan, ...
Tape-reversal bounded turing machine computations
1968
Journal of computer and system sciences (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 2017; you can also visit the original URL.
The file type is application/pdf.
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. ...
In this paper we continue the study of computational complexity by investigating a complexity measure based on the number of tape reversals which are required to perform the computation on an on-line Tufmg ...
The computing devices which we consider are two-tape Turing machines with a one-way-read-only input tape. They have also been referred to as one-tape-on-line Turing machines [4] . ...
doi:10.1016/s0022-0000(68)80027-3
fatcat:y3zt6ozcindsrk77krw2exwgsi
Selecting a preservation photocopy machine
2019
College & research libraries news
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.
The tape is rubbed 5-6 times with four fingers. The tape strip is peeled off the paper and the adhesive side of the tape examined. ...
starting a job search or checking 3) Copy quality-we w anted to compare the contrast and clarity of the copies on the text, line drawings, illustrations, and photographs. ...
pass the tape pull test by ad justing internal pressure and fusing tempera ture to increase the degree of adhesion of toner to paper. ■
Notes ...
doi:10.5860/crln.55.1.14
fatcat:abarlfwr3vhifdqidpazcfmt3m
Page 96 of Apparel World Vol. 4, Issue 9
[page]
1983
Apparel World
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Optional accessories such as straight cut-off, hot knife cut-off and rewinder allow the manufacturer to utilize Mar- ken’s full line of fabric tapes and CSI’s to print their labels. ...
The CSI supply and rewind are both monitored and accessed from the front of the machine. ...
« Previous
Showing results 1 — 15 out of 2,817 results