Editing Talk:1692: Man Page
Please sign your posts with ~~~~ |
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 49: | Line 49: | ||
β[[User:PhantomLimbic|PhantomLimbic]] ([[User talk:PhantomLimbic|talk]]) 07:30, 10 June 2016 (UTC) | β[[User:PhantomLimbic|PhantomLimbic]] ([[User talk:PhantomLimbic|talk]]) 07:30, 10 June 2016 (UTC) | ||
β | :Indeed. Turing's proof for the halting theorem says that there is no algorithm that | + | :Indeed. Turing's proof for the halting theorem says that there is no algorithm that can determine whether any possible program/input combination will halt. However, this doesn't necessarily mean that it's impossible to develop an algorithm that determines whether a particular, fixed program will halt on an arbitrary input. [[Special:Contributions/141.101.104.141|141.101.104.141]] 08:14, 10 June 2016 (UTC) |
Currently, there is no mention of the unmatched square brackets in the synopsis, or unmatched parenthesis in the title text. Presumably a reference to XKCD comic 859. [[Special:Contributions/141.101.98.77|141.101.98.77]] 07:51, 10 June 2016 (UTC) | Currently, there is no mention of the unmatched square brackets in the synopsis, or unmatched parenthesis in the title text. Presumably a reference to XKCD comic 859. [[Special:Contributions/141.101.98.77|141.101.98.77]] 07:51, 10 June 2016 (UTC) |