Recursive Functions

Luis E. Sanchis
Additional contact information
Luis E. Sanchis: Syracuse University, School of Computer and Information Science

Chapter Chapter 2 in Reflexive Structures, 1988, pp 36-67 from Springer

Abstract: Abstract All the specification rules in the preceding chapter are explicit, in the sense that the function (or predicate) being specified is determined entirely by a procedure involving only the given functions and predicates. Now we consider recursive specifications, in which a function h is specified by a rule involving the function h itself. Such a procedure is essentially ambiguous, because in general there are many functions satisfying the specification. This ambiguity can be disposed of only by elimination of the recursion, and this can be done in several ways. Closure under recursive specifications is used to define recursive functions. The relation with Church’s thesis is discussed in some detail.

Keywords: Recursive Function; Computable Function; Elementary Operation; Functional Transformation; Partial Definition (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3878-2_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461238782

DOI: 10.1007/978-1-4612-3878-2_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().