Parisi on Incomputable Algorithms

Incomputable algorithms are not exceptional probabilities, marking, for instance, the moment at which programming breaks down. On the contrary, incomputable probabilities are known probabilities that point toward a new conception of rule. The latter is exposed to a certain indeterminate quantity that cannot be compressed in a smaller cipher or simpler axioms than the output achieved. This new quantitative level of uncertainty is at the core of the metamodeling of everyday operations of programming, designing, measuring, and calculating probabilities through digital, biodigital, and nanobiological machines.

Luciana Parisi, Contagious Architecture p.21

This entry was posted in Quote Time, Theory and tagged , , , . Bookmark the permalink.