A Note on Accelerated Turing Machines
Login
University Home
→
Library
JavaScript is disabled for your browser. Some features of this site may not work without it.
A Note on Accelerated Turing Machines
Calude, C. S
;
Staiger, L
Identifier:
http://hdl.handle.net/2292/3857
Issue Date:
2009-02
Reference:
CDMTCS Research Reports CDMTCS-350 (2009)
Rights:
The author(s)
Rights (URI):
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
Abstract:
In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in accelerated mode.
Show full item record
Files in this item
Name:
350cris.pdf
Size:
169.6Kb
Format:
PDF
Related URL:
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial
This item appears in the following Collection(s)
CDMTCS Research Reports (1995+)
[574]
Share
Search ResearchSpace
Search ResearchSpace
This Collection
Browse
All of ResearchSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Statistics
View Usage Statistics