Amount of information in SAT is estimated and compared with the amount of information in the fixed code algorithms. A remark on SAT Kolmogorov complexity is made. It is argued that SAT can be polynomial-time solvable, or not, depending on the solving algorithm information content.

翻译：对SAT中的信息量进行了估计，并与固定代码算法中的信息量进行了比较。对SAT的柯尔莫哥洛夫复杂性进行了评述。论证了SAT是否具有多项式时间可解性，取决于求解算法的信息内容。