The amount of information in satisfiability problem (SAT) is considered. SAT can be polynomial-time solvable when the solving algorithm holds an exponential amount of information. It is also established that SAT Kolmogorov complexity is constant. It is argued that the amount of information in SAT grows at least exponentially with the size of the input instance. The amount of information in SAT is compared with the amount of information in the fixed code algorithms and generated over runtime.

翻译：本文探讨了可满足性问题（SAT）中的信息量。当求解算法拥有指数级信息量时，SAT可在多项式时间内求解。同时证明了SAT的Kolmogorov复杂度为常数。论证表明SAT中的信息量随输入实例规模至少呈指数级增长。还比较了SAT信息量与固定代码算法信息量及其在运行过程中生成的信息量。