/Computational Irreducibility

Computational irreducibility is the idea that some systems can only be described by fully simulating them. The only way to determine the answer to a computationally irreducible question is to perform the computation. Thus it is not possible to know the outcome to a system at a future state without computing all states in between. These computations that cannot be reduced or sped up through any kind of shortcut are called computationally irreducible.


Login to your account below

Fill the forms bellow to register

Retrieve your password

Please enter your username or email address to reset your password.