Forum:Gödel's first incompleteness theorem and hypercomputation

Recall that Gödel's first incompleteness theorem states that any theory capable of expressing elementary arithmetic, and having rules expressible by a Turing machine, cannot be consistent and complete. What happens if we replace "Turing machine" with "oracle Turing machine," or even ITTMs? it's vel time 03:16, October 5, 2014 (UTC)