Presentations of computably enumerable reals

13 years 4 months ago

Download www.mcs.vuw.ac.nz

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.

Rodney G. Downey, Geoffrey LaForte

Real-time Traffic

Binary Strings | Enumerable | Prefix-free Set | TCS 2002 | Theoretical Computer Science |

claim paper

» Undecidability of the structure of the Solovay degrees of ce reals

» The computable Lipschitz degrees of computably enumerable sets are not dense

» Large Maximal Cliques Enumeration in Large Sparse Graphs

» Enumerating All Solutions for Constraint Satisfaction Problems

» RoleMiner mining roles using subset enumeration

» Trivial Reals

» Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees

» Situated Documentaries Embedding Multimedia Presentations in the Real World

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TCS
Authors	Rodney G. Downey, Geoffrey LaForte

Comments (0)

Sciweavers

Presentations of computably enumerable reals

Binary Strings | Enumerable | Prefix-free Set | TCS 2002 | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers