Presentations of computably enumerable reals

We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Rodney G. Downey, Geoffrey LaForte
• Keywords: Binary Strings, Enumerable, Prefix-free Set, TCS 2002, Theoretical Computer Science