Institute Output
Kolmogorov Complexity vs. Computational Irreducibility: Understanding the Distinction
James K. Wiles
Kolmogorov complexity and computational irreducibility describe two kinds of limits on simplification, but they apply in different ways. Kolmogorov complexity measures the shortest possible description of an object, such as a string. Computational irreducibility refers to processes that cannot be predicted or accelerated. This paper introduces each concept, explains their theoretical distinction, and illustrates the difference using simple examples.
The Problem of Distributed Consensus
Stephen Wolfram
In any decentralized system with computers, people, databases, measuring devices or anything else one can end up with different values or results at different “nodes”. But for all sorts of reasons one often wants to agree on a single “consensus” value, that one can for example use to “make a decision and go on to the next step”.