Clarification:

All computation seems to me to also be thought.

I cannot think of a computation which cannot be thought.

It’s interesting sometimes, but most of the time you just end up reinventing the wheel with a different name and a different number of spokes. Everything I do has to satisfy a constructivist . . . it all has to be mathematically provable from the bumumptions. A lot of computer science is like: “Yeah, we can’t prove it, but you can see where it goes, right?”. Indirect proofs are rarely allowed.

So yeah, that guy Dijkstra and his algorithm? That so useful algorithm you could use in every computation ever by defining nodes and edges reasonably? I’m not allowed to use that unless the axioms of choice for graph theory are accepted. Hamiltonian paths/graphs? Same thing.

And what if I run into NP complete? I’m not allowed to estimate . . .

But yeah, looking forward to your answer.