If programs are proofs, Turing completeness is trivialism. #realtalk
-
-
@ProofOfLogic In a total language, you can simulate turing machines to an arbitrary finite number of steps without sacrificing consistency. -
@luqui it was like 50/50 your reply was a very clever joke I wasn't seeing vs a real technical point - 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.