Determining and stationary sets for some classes of partial recursive functions
From MaRDI portal
Publication:757357
DOI10.1016/0304-3975(91)90178-5zbMath0723.03024OpenAlexW2059305266WikidataQ57001792 ScholiaQ57001792MaRDI QIDQ757357
Cristian S. Calude, Gabriel I. Istrate
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90178-5
Cites Work
- Unnamed Item
- Unnamed Item
- Subword topology
- An algorithm for imbedding cubic graphs in the torus
- Theories of computational complexity
- Differentiation of real functions
- Classical recursion theory. Vol. II
- Sur la détermination d'une fonction par les valeurs prises sur un certain ensemble
- Topological Size of Sets of Partial Recursive Functions
This page was built for publication: Determining and stationary sets for some classes of partial recursive functions
