Skip to main content
Formatting and copy-edit
Source Link
David Richerby
  • 82.2k
  • 26
  • 144
  • 238

imI'm struggling to find a way to show that T = { < M > | M does not halt on any input }$$T = \{ \langle M \rangle\mid M \text{does not halt on any input}\}$$ is undecidable. Should iI use reduction? If so -, reduce this to what, &ndashp the halting problem?

im struggling to find a way to show that T = { < M > | M does not halt on any input } is undecidable. Should i use reduction? If so - reduce this to what, the halting problem?

I'm struggling to find a way to show that $$T = \{ \langle M \rangle\mid M \text{does not halt on any input}\}$$ is undecidable. Should I use reduction? If so, reduce this to what &ndashp the halting problem?

Source Link

Turing machine that does not halt on any input

im struggling to find a way to show that T = { < M > | M does not halt on any input } is undecidable. Should i use reduction? If so - reduce this to what, the halting problem?