Breaking the Turing Barrier

Show simple item record

dc.contributor.author Calude, C.S en
dc.contributor.author Dinneen, Michael en
dc.date.accessioned 2009-04-16T23:10:18Z en
dc.date.available 2009-04-16T23:10:18Z en
dc.date.issued 1998-05 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-084 (1998) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri http://hdl.handle.net/2292/3593 en
dc.description.abstract Is there any limit to discrete computation, and more generally, to scientific knowledge? This is one of the problems studied by the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland. 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 Breaking the Turing Barrier 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


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics