OnlineWoerterBuecher.de
Internes

Lexikon


General Recursion Theorem


S> 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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="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 - (2313 Reads)

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

Page Generation in 0.0899 Seconds, with 17 Database-Queries
Zurück zur Startseite