Back to Results
First PageMeta Content
Theoretical computer science / Mathematical logic / Computable function / Halting problem / Primitive recursive function / Church–Turing thesis / Function / Recursively enumerable set / Algorithm / Mathematics / Theory of computation / Computability theory


CANTOR’S DIAGONAL ARGUMENT: PROOF AND PARADOX Cantor’s diagonal method is elegant, powerful, and simple. It has been the source of
Add to Reading List

Document Date: 2011-07-28 22:14:56

Open Document

File Size: 106,77 KB

Share Result on Facebook

City

Amsterdam / New York / /

Company

Prentice-Hall / Norton / Harvard University Press / Russell / McGraw-Hill / /

Country

Netherlands / /

Currency

EUR / /

IndustryTerm

free-loop algorithm / ith algorithm / bounded-loop algorithms / valid algorithms / bounded-loop algorithm / /

Organization

Harvard University / /

Person

Abraham A. Fraenkel / Georg Cantor / Hartley Rogers / Yehoshua Bar-Hillel / Bertrand Russell / David Hilbert / Morgan Abel Boole Brouwer Sierpinski Weierstrass / Harley Rogers / Jr. / Douglas Hofstadter / Quoting Hartley Rogers / Joseph Warren Dauben / /

Position

mathematician / famous mathematician / /

ProvinceOrState

New Jersey / New York / /

Region

North Holland / /

Technology

ith algorithm / bounded-loop algorithm / bounded-loop algorithms / terminating algorithms / valid algorithms / One free-loop algorithm / /

SocialTag