Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 6 - Aspects of Chaitin’s Omega

  • Edited by Johanna N. Y. Franklin, Hofstra University, New York, Christopher P. Porter, Drake University, Iowa
  • Book:
    Algorithmic Randomness
    Published online:
    07 May 2020
    Print publication:
    07 May 2020, pp 175-205

  • Summary

    The halting probability of a Turing machine was introduced by Chaitin, who also proved that it is an algorithmically random real number and named it Omega. Since his seminal work, many popular expositions have appeared, mainly focusing on the metamathematical or philosophical significance of this number (or debating against it). At the same time, a rich mathematical theory exploring the properties of Chaitin's Omega has been brewing in various technical papers, which quietly reveals the significance of this number to many aspects of contemporary algorithmic information theory. The purpose of this survey is to expose these developments and tell a story about Omega which outlines its multi-faceted mathematical properties and roles in algorithmic randomness.