Premium
RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS
Author(s) -
Calude Cristian,
Istrate Gabriel,
Zimand Marius
Publication year - 1992
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19920380112
Subject(s) - baire category theorem , baire measure , baire space , mathematics , nowhere dense set , set (abstract data type) , pure mathematics , discrete mathematics , computer science , programming language
Using recursive variants of Baire notions of nowhere dense and meagre sets we study the topological size of speedable and infinitely often speedable functions in a machine‐independent framework. We show that the set of speedable functions is not “small” whereas the set of infinitely often speedable functions is “large”. In this way we offer partial answers to a question in [4].