Recursive definition
id:
recursive-definition-317-11397487
title:
Recursive definition
text:
In mathematics and computer science, a recursive definition, or inductive definition, is used to define the elements in a set in terms of other elements in the set. Some examples of recursively-definable objects include factorials, natural numbers, Fibonacci numbers, and the Cantor ternary set. A recursive definition of a function defines values of the function 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 r
brand slug:
wiki
category slug:
encyclopedia
description:
Defining elements of a set in terms of other elements in the set
original url:
https://en.wikipedia.org/wiki/Recursive_definition
date created:
date modified:
2024-03-21T11:17:15Z
main entity:
{"identifier":"Q2466486","url":"https://www.wikidata.org/entity/Q2466486"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d9/KochFlake.svg","width":362,"height":362}
fields total:
13
integrity:
15