Thumbnail
Access Restriction
Open

Author Beigel, Richard ♦ Fortnow, Lance ♦ Stephan, Frank
Source CiteSeerX
Content type Text
Publisher Springer-Verlag
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Infinitely-often Autoreducible Set ♦ Special Symbol
Description A set A is autoreducible if one can compute, for all x, the value A(x) by querying A only at places y x. Furthermore, A is infinitely-often autoreducible if, for infinitely many x, the value A(x) can be computed by querying A only at places y x. For all other x, the computation outputs a special symbol to signal that the reduction is undefined.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2003-01-01
Publisher Institution IN PROCEEDINGS OF THE 14TH ANNUAL INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION