Incompleteness and the Halting Problem

Calude, CS

dc.contributor.author	Calude, CS	en
dc.date.accessioned	2022-01-14T03:42:09Z
dc.date.available	2022-01-14T03:42:09Z
dc.date.issued	2020	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-546 (2020)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	https://hdl.handle.net/2292/58008
dc.description.abstract	We present an abstract framework in which we give simple proofs for Gödel’s First and Second Incompleteness Theorems and obtain, as consequences, Davis’, Chaitin’s and Kritchman-Raz’s Theorems.
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php	en
dc.title	Incompleteness and the Halting Problem	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research	en
dc.rights.holder	Copyright: The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en