Determining and stationary sets for some classes of partial recursive functions
type: Item
instance of: scholarly article
title: Determining and stationary sets for some classes of partial recursive functions
zbMATH Open document ID: 0723.03024
DOI: 10.1016/0304-3975(91)90178-5
author: Cristian S. Calude
author: Gabriel Istrate
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 4191612
zbMATH Keywords: determining sets
zbMATH Keywords: simple sets
zbMATH Keywords: stationary sets
zbMATH Keywords: Post simple sets
Wikidata QID: Q57001792
MaRDI profile type: Publication
full work available at URL: 0304-3975(91)90178-5
OpenAlex ID: W2059305266
cites work: Sur la détermination d'une fonction par les valeurs prises sur un certain ensemble
cites work: Differentiation of real functions
cites work: Topological Size of Sets of Partial Recursive Functions
cites work: Theories of computational complexity
cites work: Subword topology
cites work: An algorithm for imbedding cubic graphs in the torus
cites work: Classical recursion theory. Vol. II
cites work: Q5573961
cites work: Q3819052
DBLP publication ID: journals/tcs/CaludeI91
description: scientific article; zbMATH DE number 4191612