From Conservapedia
This is an old revision of this page, as edited by NKeaton (Talk | contribs) at 09:18, 26 February 2013. It may differ significantly from current revision.

Jump to: navigation, search

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:

  1. a predicate
  2. the negation of a WFF
  3. the combination of two WFF's with a binary operator

The LISP programming language uses a recursive data structure. Most programming languages permit recursion by allowing the programmer call a function within itself. Some have no syntax for making looping code other than by recursion.

A fascination with recursive definitions in the software development community (free software in particular) led to the invention of several recursive acronyms:

  • PHP (originally Personal Home Page) => PHP Hypertext Pre-processor
  • GNU (GNU's Not Unix)
  • WINE (Wine Is Not an Emulator)
  • YAML (YAML Ain't Markup Language)

See also

External links

Unit on recursion in free online computer science course from MIT.