Difference between revisions of "Recursiveness"
Jump to navigation
Jump to search
(Good joke, but here's the real meaning) |
|||
| Line 8: | Line 8: | ||
A fascination with recursive definitions in the software development community led to the invention of several recursive acronyms: | A fascination with recursive definitions in the software development community led to the invention of several recursive acronyms: | ||
*[[PHP]] (originally Personal Home Page) => PHP Hypertext Pre-processor | *[[PHP]] (originally Personal Home Page) => PHP Hypertext Pre-processor | ||
| − | |||
| − | |||
==See also== | ==See also== | ||
*[[Fractal]] | *[[Fractal]] | ||
| + | [[category:logic]] | ||
Revision as of 09:19, April 27, 2007
Recursiveness is the quality of being defined in terms which include the whole. For example, in symbolic logic a well-formed formula (WFF) can be either:
- a predicate
- the negation of a WFF
- the combination of two WFF's with a binary operator
The LISP programming language uses a recursive data structure.
A fascination with recursive definitions in the software development community led to the invention of several recursive acronyms:
- PHP (originally Personal Home Page) => PHP Hypertext Pre-processor