Your intuition is right. The total functions are not even a provable set. So they are definitely not recursive or even FNP; never mind TFNP. Provability of the total functions would imply decidability of an even harder…
[dead]
> Yeah the whole post is stupid, but it’s also just wrong: c is not bound by pointer size. > But let’s just go nuts: you can make a Turing machine in C that implements the tape as a stream api that wraps all the cloud…
Your intuition is right. The total functions are not even a provable set. So they are definitely not recursive or even FNP; never mind TFNP. Provability of the total functions would imply decidability of an even harder…
[dead]
[dead]
> Yeah the whole post is stupid, but it’s also just wrong: c is not bound by pointer size. > But let’s just go nuts: you can make a Turing machine in C that implements the tape as a stream api that wraps all the cloud…