## 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 oft
A Classification of the Recursive Functions
β Scribed by Albert R. Meyer; Dennis M. Ritchie
- Publisher
- John Wiley and Sons
- Year
- 1972
- Tongue
- English
- Weight
- 744 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
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 ' ' Z,," as an abbreviation for "x1, x2, . . . , x,,".
π SIMILAR VOLUMES
The correlation function of two Walsh functions appears in image processing, signal multiplexing, detection and spectral analysis using Walsh functions. Though Walsh functions are two-valued, their correlation functions are real-valued and rather diffccult to evaluate. A recursive formula is develop
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