activity
20022024
most citedSome consequences of a recursive number-theoretic relation that is not the standard interpretation of any of its formal representations

8 citations · 19 across the 40 of their papers we have counts for

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2024

Why the classes P and NP are not well-defined finitarily

Bhupinder Singh Anand

We distinguish finitarily between algorithmic verifiability, and algorithmic computability, to show that Goedel's 'formally' unprovable, but 'numeral-wise' provable, arithmetical p…