Ahh.
-
sophisticated manipulation of programs in turing complete language, switching b/w representations, it all works
decidability plays little role in compiler construction, infinite loops/recursion come up but are trivial bugs
-
-
Example: http://compilers.cs.ucla.edu/popl16/popl16-full.pdf … is surprising because it should be undecidable
-
actually v. relevant to my rambling, it shows how to work around the "diagonalization gadget" of halting prob.
End of conversation
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.