Lesson plan
Transcomputational problem
In computational complexity theory, a transcomputational problem is a problem that requires processing of more than 10 93 bits of information. Any number greater than 10 93 is called a transcomputational number. The number 10 93 , called Bremermann's limit, is, according to Hans-Joachim Bremermann, the total number of bits processed by a hypothetical computer the size of the Earth within a time period equal to the estimated age of the Earth. The term transcomputational was coined by Bremermann.
Article summary
In computational complexity theory, a transcomputational problem is a problem that requires processing of more than 10 93 bits of information. Any number greater than 10 93 is called a transcomputational number. The number 10 93 , called Bremermann's limit, is, according to Hans-Joachim Bremermann, the total number of bits processed by a hypothetical computer the size of the Earth within a time period equal to the estimated age of the Earth. The term transcomputational was coined by Bremermann.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.