Timeline for Prove that there exists a machine which decides an infinite subset of halting problem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2019 at 16:56 | comment | added | Yonatan N | It's probably easiest to visualize this in terms of some code in your favorite programming language. Is there a simple algorithm you can write that can correctly diagnose that a (say) Python script is of a particular never-halting form? Sure. Consider any valid program that starts with the string "while True: x=1;", of which there are infinitely many (e.g the next line could be "a=1", or "a=2", or "a=3", etc.). Such a program never halts and is easy to identify. | |
| Feb 7, 2019 at 15:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 8, 2019 at 14:55 | answer | added | dkaeae | timeline score: 1 | |
| Jun 14, 2017 at 7:43 | comment | added | Sid Caroline | $L=\{\langle M, w\rangle|M$ halts on $w$ in less than 10 steps$\}$. | |
| Jun 14, 2017 at 6:00 | comment | added | Raphael | Hint: There are infinitely many machines for which the halting problem is trivial. | |
| Jun 14, 2017 at 6:00 | history | edited | Raphael |
edited tags
|
|
| Jun 14, 2017 at 6:00 | comment | added | Raphael | What have you tried? Where did you get stuck? We do not want to just hand you the solution; we want you to gain understanding. However, as it is we do not know what your underlying problem is, so we can not begin to help. See here for tips on asking questions about exercise problems. If you are uncertain how to improve your question, why not ask around in Computer Science Chat? | |
| Jun 14, 2017 at 5:33 | history | asked | Sid Caroline | CC BY-SA 3.0 |