Therefore, there are some Turing machines which can't be
  proven to halt or run forever in any given consistent
  system that can be computed.

I feel like it's worth clarifying the quantifiers here. For all consistent systems, there exist Turing machines whose halting behavior can't be proven in that system. Unless I have some disastrous misunderstanding...