Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
    Tweeted twitter.com/StackCompSci/status/771336718863699969
4 Fixing typo in title
source | link

If modern computers aren't actually turingTuring-complete, does that mean that it is possible to determine if a program run on such a computer halts?

The Halting Problemhalting problem says that it is impossible to create a general algorithm which can for all inputs and programs determine whether they halt. However, this assumes that the programs and/or the things running them are turing completeTuring-complete.

Since all computers have a finite amount of memory and are therefor not turingTuring-complete, does that mean that the halting problem does not apply to a program run on a machine with finite memory?

If modern computers aren't actually turing-complete, does that mean that it is possible to determine if a program run on such a computer halts?

The Halting Problem says that it is impossible to create a general algorithm which can for all inputs and programs determine whether they halt. However, this assumes that the programs and/or the things running them are turing complete.

Since all computers have a finite amount of memory and are therefor not turing-complete, does that mean that the halting problem does not apply to a program run on a machine with finite memory?

If modern computers aren't actually Turing-complete, does that mean that it is possible to determine if a program run on such a computer halts?

The halting problem says that it is impossible to create a general algorithm which can for all inputs and programs determine whether they halt. However, this assumes that the programs and/or the things running them are Turing-complete.

Since all computers have a finite amount of memory and are therefor not Turing-complete, does that mean that the halting problem does not apply to a program run on a machine with finite memory?

3 Fixing typo in title
| link

If modern computers aren't actually turningturing-complete, does that mean that it is possible to determine if a program run on such a computer halts?

2 edited tags
| link
1
source | link