Determining and stationary sets for some classes of partial recursive functions

DOI10.1016/0304-3975(91)90178-5MaRDI QIDQ757357zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Cristian S. Calude, Gabriel 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

zbMATH Keywords

stationary setsdetermining setsPost simple setssimple sets

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Partial functions and domination
• On Closed Classes of Primitive Recursive Functions, II
• Relativized topological size of sets of partial recursive functions
• scientific article; zbMATH DE number 3865259
• scientific article; zbMATH DE number 3997775

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• An algorithm for imbedding cubic graphs in the torus
• Classical recursion theory. Vol. II
• Differentiation of real functions
• 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)

• scientific article; zbMATH DE number 3859103 (Why is no real title available?)
• Learning determining sets of finite partially defined functions
• Partial functions and domination
• A Note on Conjectures of Calude About the 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757357)