Meta-Mathematics and the Foundations of Mathematics

About this item

Title

Meta-Mathematics and the Foundations of Mathematics

Content partner

The University of Auckland Library

Collection

ResearchSpace@Auckland

Description

This article discusses what can be proved about the foundations of mathematics using the notions of algorithm and information. The first part is retrospective, and presents a beautiful antique, Gödel’s proof; the first modern incompleteness theorem, Turing’s halting problem; and a piece of postmodern metamathematics, the halting probability Ω. The second part looks forward to the new century and discusses the convergence of theoretical physics and theoretical computer science and hopes for a ...

Read more

Format

Research paper

Research format

Report

Date created

2002-05

Creator

Chaitin, G.J

URL

http://hdl.handle.net/2292/3690

Related subjects

Information, Computing and Communication Sciences

What is the copyright status of this item?

Share, Modify, Use commercially

See below for specifics about how you may use this item.

More Information

The University of Auckland Library has this to say about the rights status of this item:

https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm

You can learn more about the rights status of this item at:

• https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
• http://purl.org/eprint/accessRights/OpenAccess

What can I do with this item?

You must always check with The University of Auckland Library to confirm the specific terms of use, but this is our understanding:

Non-infringing use

NZ Copyright law does not prevent every use of a copyright work. You should consider what you can and cannot do with a copyright work.

Share it

This item is suitable for copying and sharing with others, without further permission.

Modify it

This item is suitable for modifying, remixing and building upon, without further permission.

Use it commercially

This item is suitable for commercial use, without further permission.