Right, so there are technical conditions such as this that apply; finding proofs of bounded length where the bound is given in unary is NP complete. Otherwise if arbitrary-length proof count, it’s halting-complete.
Right, so there are technical conditions such as this that apply; finding proofs of bounded length where the bound is given in unary is NP complete. Otherwise if arbitrary-length proof count, it’s halting-complete.