Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1128

Title: recursive function
Issue Date: 9-Nov-2006
Publisher: PlanetMath
Citation: http://planetmath.org/encyclopedia/RecursiveFunction.html
Abstract: Intuitively, a recursive function is a positive integer valued function of one or more positive integer arguments which may be computed by a definite algorithm. Recursive functions may be defined more rigorously as the largest class of partial functions from ... satisfying the following six criteria: ... The constant function ... defined by ... for all ... is a recursive function. ... The addition function ... and the multiplication function ... are recursive function. ... The projection functions ... with ... defined as ... are recursive functions. ... (Closure under composition) If ... is a recursive function and ... with ... are recursive functions, then ... , defined by ... is a recursive function. ... (Closure under primitive recursion) If ... and ... are recursive function, then ... , defined by the recursion ... with the initial condition ... is a recursive function. ... (Closure under minimization) If ... is a recursive function then ... is a recursive function, where
URI: http://www.citidel.org/handle/10117/1128
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat
RecursiveFunction.html32KbHTMLView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback