<--- Back to Details
First PageDocument Content
Mathematics / Theoretical computer science / Theory of computation / Structural complexity theory / Computability theory / Halting problem / Mathematical proof / Undecidable problem / Negation / Reductio ad absurdum / Reduction / Square root of 2
Date: 2007-04-18 22:48:16
Mathematics
Theoretical computer science
Theory of computation
Structural complexity theory
Computability theory
Halting problem
Mathematical proof
Undecidable problem
Negation
Reductio ad absurdum
Reduction
Square root of 2

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary

Add to Reading List

Source URL: philosopher-animal.com

Download Document from Source Website

File Size: 147,98 KB

Share Document on Facebook

Similar Documents

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

DocID: 1r1Rx - View Document

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND  LANCE FORTNOWz

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

DocID: 1qYTn - View Document

Microsoft Word - MS-wccm12

Microsoft Word - MS-wccm12

DocID: 1qPof - View Document

Microsoft Word - fp16-armoni.doc

Microsoft Word - fp16-armoni.doc

DocID: 1qoBn - View Document

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas  Summary

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary

DocID: 1qeXR - View Document