Anand, Bhupinder Singh - 2018
If we assume the Thesis that any classical Turing machine T, which halts on every -ary sequence of natural numbers as input in a determinate time (), determines a PA-provable formula, whose standard interpretation is an -ary arithmetical relation (, ..., ) that holds if, and only if, T halts,...