RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS
Cristian S. Calude, Gabriel Istrate, Marius Zimand
Abstract
Cristian S. Calude, Gabriel Istrate, Marius Zimand
Abstract
Abstract 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].
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract 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].
Key concepts: Baire category theorem, Baire measure, Baire space, Mathematics, Nowhere dense set, Set (abstract data type), Pure mathematics, Discrete mathematics