I'm not sure that my paradox even requires the proof system to prove it's own consistency.
If the system is inconsistent, your program will halt on all inputs with output dependent on whether it happens to find a proof of "this program halts" or "this program doesn't halt" first.
Of course a crippled logic can't prove interesting things about Turing machines.
Well, mathematicians have been proving interesting things about Turing machines for the past century despite these limitations.
If it's worth saying, but not worth its own post (even in Discussion), then it goes here.
Notes for future OT posters:
1. Please add the 'open_thread' tag.
2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)
3. Open Threads should be posted in Discussion, and not Main.
4. Open Threads should start on Monday, and end on Sunday.