Computational irreducibility
- A property of computations that cannot be sped up by a shortcut, i.e., which cannot be predicted. Computational irreducibility can be used to explain observed limitations of existing mainstream science. In cases of computational irreducibility, only observation and experiment can be used. ← Wikipedia
- More about this term (beta): articles and videos, books, web search
- Previous term: Compression
- Next term: Computed value
- Random term: Programming language (or roll the dice with webglossary.info/random)