计算复杂性守恒原理
计算复杂性
2018-01-08 v3
摘要
在本稿中，我们推导出计算复杂性守恒原理。我们将计算复杂性度量为解决一个问题所需的二元计算（判定）次数。于是每个问题定义一个可由比特度量的唯一解空间。对于精确结果，解空间中的判定既不可被预测也不可被丢弃，只能在输入与算法之间转移。我们以命题逻辑可满足性问题（）为例演示并解释该原理。由此不可避免地得出 。我们还基于该原理给出了停机问题不可判定性的一种替代解释。
引用
@article{arxiv.1712.01178,
title = {Principle of Conservation of Computational Complexity},
author = {Gerald Friedland and Alfredo Metere},
journal= {arXiv preprint arXiv:1712.01178},
year = {2018}
}
备注
This version of the article improves on the previous versions by generalizing to a general principle. This way, the very technical reduction of the halting problem to SAT_syntax is unnecessary. The authors would like to thank their peers for feedback and arxiv.org for enabling it. Feedback is always encouraged