𝔖 Bobbio Scriptorium
✦   LIBER   ✦

RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS

✍ Scribed by Cristian Calude; Gabriel Istrate; Marius Zimand

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
496 KB
Volume
38
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

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].

📜 SIMILAR VOLUMES

A Classification of the Recursive Functi
A Classification of the Recursive Functions
✍ Albert R. Meyer; Dennis M. Ritchie 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 744 KB

This research was supported in part by NSF Grant GP-2880, ARPA grant SD-146, and 2) We use L L C" to denote proper inclusion, and ''2" for improper inclusion. DSR 79457 under Project MAC. I) The operation of substitution consists of composition of functions and explicit transformation. \*) We use '

Density and Baire category in recursive
Density and Baire category in recursive topology
✍ Iraj Kalantari; Larry Welch 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

## Abstract We develop the concepts of recursively nowhere dense sets and sets that are recursively of first category and study closed sets of points in light of Baire's Category Theorem. Our theorems are primarily concerned with exdomains (i. e. complements of domains) of recursive quantum functio

Baire category and nowhere differentiabi
Baire category and nowhere differentiability for feasible real functions
✍ Josef M. Breutzmann; David W. Juedes; Jack H. Lutz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB

## Abstract A notion of resource‐bounded Baire category is developed for the class __P__~__C__[0,1]~ of all polynomial‐time computable real‐valued functions on the unit interval. The meager subsets of __P__~__C__[0,1]~ are characterized in terms of resource‐bounded Banach‐Mazur games. This characte

Hierarchies of Primitive Recursive Funct
Hierarchies of Primitive Recursive Functions
✍ Charles Parsons 📂 Article 📅 1968 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

9 Yn), ~1 , \* \* . ? ~n l then the definition of 97 is of degree max ( p ) q) + 1 . l) l ) We omit from consideration the schema for recursion without pareymeters. It can be accommodated into our arguments by simplified versions of the arguments for (V), or it can be omitted as a primitive schema w