Determining and stationary sets for some classes of partial recursive functions

DOI10.1016/0304-3975(91)90178-5zbMATH Open0723.03024DBLPjournals/tcs/CaludeI91OpenAlexW2059305266WikidataQ57001792 ScholiaQ57001792MaRDI QIDQ757357FDOQ757357

Gabriel Istrate, Cristian S. Calude

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

zbMATH Keywords

stationary setsdetermining setsPost simple setssimple sets

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical recursion theory. Vol. II
• Differentiation of real functions
• An algorithm for imbedding cubic graphs in the torus
• Theories of computational complexity
• Topological Size of Sets of Partial Recursive Functions
• Subword topology
• Sur la détermination d'une fonction par les valeurs prises sur un certain ensemble

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Partial functions and domination 👍 👎
• On Closed Classes of Primitive Recursive Functions, II 👍 👎
• Relativized topological size of sets of partial recursive functions 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)