Recursively Enumerable Reals and Chaitin Omega Numbers

About this item

Title

Recursively Enumerable Reals and Chaitin Omega Numbers

Content partner

The University of Auckland Library

Collection

ResearchSpace@Auckland

Description

A real α is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting probability of a universal self- delimiting Turing machine (Chaitin's Ω number, [10]) is a random r.e. real. Solovay's [25] Ω-like reals are also random r.e. reals. Solovay showed that any Chaitin Ω number is Ω-like

Read more

Format

Research paper

Research format

Report

Date created

1997-10

Creator

Calude, C.S / Hertling, P.H / Khoussainov, B / Wang, Y

URL

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

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.