High Quality Content by WIKIPEDIA articles! In mathematical logic and computer science, a recursive definition (or inductive definition) is used to define an object in terms of itself (Aczel 1978:740ff). A recursive definition of a function defines values of the functions for some inputs in terms of the values of the same function for other inputs. For example, the factorial function n! is defined by the rules. 0! = 1. (n+1)! = (n+1)·n!.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.