On the size of sets of computable functions

Authors:
Kurt Mehlhorn
Affiliations:
-
Venue:
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Year:
1973

Citing 0
Cited 5

Baire Category and Nowhere Differentiability for Feasible Real Functions

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Quantitative Aspects of Speed-Up and Gap Phenomena

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Automatic forcing and genericity: on the diagonalization strength of finite automata

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Quantitative aspects of speed-up and gap phenomena

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the size of sets of computable functions using category-theoretic methods (in the sense of the Baire Category theorem). Constructive definitions of no-where dense and meagre set are given and applied to several problems. In particular we apply it to subrecursive degree structures and to a comparison of the power of deterministic and nondeterministic time bounded oracle machines.