Incompleteness and the Halting Problem
Author: Calude, CS
Publisher: Department of Computer Science, The University of Auckland, New Zealand
Link to this item using this URL: https://hdl.handle.net/2292/58008
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.
Subjects: Fields of Research
Citation: ["CDMTCS Research Reports CDMTCS-546 (2020)"]
Copyright: 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.