Efficient programs of NPC problems should be length upper-bounded, and a thought experiment to search for them by machine enumeration

YuQian Zhou

This paper proposes a thought experiment to search for efficient bounded algorithms of NPC problems by machine enumeration. The key contributions are: -- On Universal Turing Machin…