Determining and stationary sets for some classes of partial recursive functions

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In analogy with the case of real functions we introduce and study the determining and stationary sets for some classes of unary p.r. functions, including the recursive and primitive recursive functions. As a by-product, a new characterization of Post simple sets is obtained, which offers a natural motivation for their name. © 1991.

Cite

CITATION STYLE

APA

Calude, C., & Istrate, G. (1991). Determining and stationary sets for some classes of partial recursive functions. Theoretical Computer Science, 82(1), 151–155. https://doi.org/10.1016/0304-3975(91)90178-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free