Transcomputational problem
In computational complexity theory, a transcomputational problem is a problem that requires processing of more than 1093 bits of information. Any number greater than 1093 is called a transcomputational number. The number 1093, 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.
- Comment
- enIn computational complexity theory, a transcomputational problem is a problem that requires processing of more than 1093 bits of information. Any number greater than 1093 is called a transcomputational number. The number 1093, 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.
- Has abstract
- enIn computational complexity theory, a transcomputational problem is a problem that requires processing of more than 1093 bits of information. Any number greater than 1093 is called a transcomputational number. The number 1093, 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.
- Hypernym
- Problem
- Is primary topic of
- Transcomputational problem
- Label
- enTranscomputational problem
- Link from a Wikipage to another Wikipage
- Boolean data type
- Bremermann's limit
- Brute-force search
- Category:Computational complexity theory
- Category:Limits of computation
- Category:Theory of computation
- Cell (biology)
- Chessboard
- Color
- Computational complexity theory
- Computational problem
- Earth
- Hans-Joachim Bremermann
- Hitchhiker's Guide to the Galaxy
- Hypertask
- Input (computer science)
- Integrated circuit
- Light sensitivity
- Matrioshka brain
- Output (computing)
- Pattern
- Pattern recognition
- Retina
- Strict finitism
- System
- SameAs
- 48jJC
- m.0gmckbh
- Problema transcomputacional
- Problema transcomputacional
- Q4461978
- Transcomputationales Problem
- Transcomputational problem
- Трансвычислительная задача
- Subject
- Category:Computational complexity theory
- Category:Limits of computation
- Category:Theory of computation
- WasDerivedFrom
- Transcomputational problem?oldid=1058742700&ns=0
- WikiPageLength
- 5888
- Wikipage page ID
- 31646448
- Wikipage revision ID
- 1058742700
- WikiPageUsesTemplate
- Template:Reflist