22 Answered Questions

[SOLVED] What exactly is the halting problem?

8 Answered Questions

[SOLVED] Practical non-Turing-complete languages?

13 Answered Questions

4 Answered Questions

[SOLVED] Determining whether a regex is a subset of another

8 Answered Questions

[SOLVED] Do all regular expressions halt?

15 Answered Questions

[SOLVED] Infinite loops in Java

4 Answered Questions

2 Answered Questions

[SOLVED] Do agda programs necessarily terminate?

3 Answered Questions

2 Answered Questions

[SOLVED] How does this proof, that the halting problem is undecidable, work?

  • 2011-12-06 01:59:28
  • jfisk
  • 16580 View
  • 18 Score
  • 2 Answer
  • Tags:   halting-problem

9 Answered Questions

1 Answered Questions

[SOLVED] Proof that the halting problem is NP-hard?

3 Answered Questions

[SOLVED] Halting in non-Turing-complete languages

2 Answered Questions