General Recursion Theorem

Computing Dictionary

General Recursion Theorem definition

Cantor's theorem, originally stated for ordinals, which extends inductive proof to recursive construction. The proof is by pasting together "attempts" (partial solutions).
[Better explanation?]

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: general quarters
Next Definition: general relativity
More from
Synonyms and Antonyms for general recursion theorem
More from
Search for articles containing general recursion theorem Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature