Now I'm stuck wondering if in a constructivist logic the Reals exist
Iris van Rooij 💭In short, a (tractable) heuristic H cannot compute uncomputable (or intractable) f. Proof sketch: Assume H would compute f (tractably), then H would be an algorithm (not a mere heuristic) and thus f would be computable (and tractable). 14/🧵