Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9655989 | Electronic Notes in Theoretical Computer Science | 2005 | 14 Pages |
Abstract
In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected with Ershov's one within Î20. The non-effective version over real functions is connected with the degrees of discontinuity and yields a hierarchy related to Hausdorff's difference hierarchy in the Borel class Î2B. Finally, the effective version over approximately computable real functions forms a hierarchy which provides a useful tool in computable analysis.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Armin Hemmerling,