A Note on Accelerated Turing Machines

Calude, C. S; Staiger, L

dc.contributor.author	Calude, C. S	en
dc.contributor.author	Staiger, L	en
dc.date.accessioned	2009-04-16T23:14:40Z	en
dc.date.available	2009-04-16T23:14:40Z	en
dc.date.issued	2009-02	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-350 (2009)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3857	en
dc.description.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.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	A Note on Accelerated Turing Machines	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en