[zer00eyz]

Are people Turing machines is a question...

> Plus, the halting problem only says that you can't have a procedure which will be 100% right on 100% of programs about whether or not they halt.

Your missing it still...

"Given a computer program and an input, will the program terminate or will it run forever?"

We both know that the collatz conjecture likely wont ever halt. We understand that. WE are reasonable oracles. Now write me an oracle that can detect this. Dont feed a list of problems to avoid, write a program that detects these types problems and skips them... Hint, you likley cant. You could simulate one, but that would be cheating...

A real AI needs this, or needs to be able to do it, or it risks working on the collatz conjecture till the heat death of the universe, or till it consumes the universe in a paperclip style problem...

The implication is that real ai might not come out of a Turing machine ever...

[roywiggins]

The implication of the article isn't that you can't produce a Turing oracle, it's that it's mathematically impossible to ever replace programmers with computers at all.

The latter claim doesn't follow: programmers aren't Turing oracles either. A programming machine that can emulate whatever humans are doing when they program, would be able to program too.

[af3d]

FWIW the Collatz conjecture actually asserts the exact opposite, that the sequence always terminates.

[oasisaimlessly]

> We both know that the collatz conjecture likely wont ever halt.

Speak for yourself. I know that the Collatz Conjecture is an unsolved problem and so wouldn't make any strong statements about it.