AbstractIn 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
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
Summary. In the article we define partial functions. We also define the following notions related to...
Abstract. A class F of partial recursive functions is called recursively enumerable if there exists ...
This paper studies possible extensions of the concept of complexity class of recursive functions to...
We give a complete characterization of the class of functions that are the intensional behaviours of...
Our goal is to define a type of partial recursive functions in constructive type theory. In a serie...
This paper studies possible extensions of the concept of complexity class of recursive functions to ...
We provide an explicit characterization of the properties of primitive recursive functions that are ...
International audienceWhat can be decided or semidecided about a primitive recursive function, given...
AbstractIn [1], a recursive topology on the set of unary partial recursive functions was introduced ...
Constructive type theories generally treat only total functions; partial functions present serious ...
Abstract Recently, functions over the reals that extend elementarily computable functions over the i...
The set of unary functions of complexity classes defined by using bounded primitive recursion is ind...
Relativizations of complexity classes in which simple sets exist are considered. A recursive oracle ...
We consider two categories with one object, namely the set of all partial functions of one variable ...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
Summary. In the article we define partial functions. We also define the following notions related to...
Abstract. A class F of partial recursive functions is called recursively enumerable if there exists ...
This paper studies possible extensions of the concept of complexity class of recursive functions to...
We give a complete characterization of the class of functions that are the intensional behaviours of...
Our goal is to define a type of partial recursive functions in constructive type theory. In a serie...
This paper studies possible extensions of the concept of complexity class of recursive functions to ...
We provide an explicit characterization of the properties of primitive recursive functions that are ...
International audienceWhat can be decided or semidecided about a primitive recursive function, given...
AbstractIn [1], a recursive topology on the set of unary partial recursive functions was introduced ...
Constructive type theories generally treat only total functions; partial functions present serious ...
Abstract Recently, functions over the reals that extend elementarily computable functions over the i...
The set of unary functions of complexity classes defined by using bounded primitive recursion is ind...
Relativizations of complexity classes in which simple sets exist are considered. A recursive oracle ...
We consider two categories with one object, namely the set of all partial functions of one variable ...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
Summary. In the article we define partial functions. We also define the following notions related to...
Abstract. A class F of partial recursive functions is called recursively enumerable if there exists ...
DOI
Add to ORKG