Determining and stationary sets for some classes of partial recursive functions
From MaRDI portal
In analogy with the case of real functions [\textit{N. Boboc} and \textit{S. Marcus}, Ann. Sci. Éc. Norm. Super., III. Sér. 76, 151-159 (1959; Zbl 0086.048)] the authors introduce and study the determining and stationary sets for some classes of p.r. functions. A new characterization of Post simple sets is obtained in this context.
Recommendations
Cites work
- An algorithm for imbedding cubic graphs in the torus
- Classical recursion theory. Vol. II
- Differentiation of real functions
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Subword topology
- Sur la détermination d'une fonction par les valeurs prises sur un certain ensemble
- Theories of computational complexity
- Topological Size of Sets of Partial Recursive Functions
Cited in
(4)
This page was built for publication: Determining and stationary sets for some classes of partial recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757357)