OnlineWoerterBuecher.de
Internes

Lexikon


General Recursion Theorem


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?] (1995-06-15)

In addition suitable contents:
[ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ by ] [ C ] [ Cantor ] [ ch ] [ co ] [ con ] [ cons ] [ cu ] [ du ] [ ec ] [ ed ] [ er ] [ et ] [ extend ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gi ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ is ] [ la ] [ Lex ] [ lu ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ ng ] [ ns ] [ ordinal ] [ pa ] [ ph ] [ pl ] [ pr ] [ proof ] [ pt ] [ query ] [ rc ] [ re ] [ recursive ] [ ro ] [ ru ] [ se ] [ si ] [ so ] [ solution ] [ st ] [ state ] [ struct ] [ T ] [ th ] [ to ] [ tr ] [ tt ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2293 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0848 Seconds, with 16 Database-Queries
Zurück zur Startseite