>
With universal machines, they explained why it’s impossible to decide if a given Turing machine ever halts
NO. NO THEY DIDN'T. :blobscream: see my pinned posts!
Top-level
> With universal machines, they explained why it’s impossible to decide if a given Turing machine ever halts NO. NO THEY DIDN'T. :blobscream: see my pinned posts! 2 comments
|
@millihertz the pinned post reads like Chatin's definition of the halting problem, which is also how I understood, isn't what Ben Lynn is describing?