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)

N="left">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 - (2367 Reads)

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

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