Jump to content

Talk:Unreachable code

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Segv11 (talk | contribs) at 22:48, 13 November 2005 (Perfect unreachability rules are impossible). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Merging in Dead code

I'm merging in the contents from Dead code. I'll post an update here when I'm done. Jamie 21:54, 13 November 2005 (UTC)[reply]

Merge done. Jamie 22:48, 13 November 2005 (UTC)[reply]

Perfect unreachability rules are impossible

The article claims that "it is infeasible to choose rules that are equivalent to true unreachability". In fact, it's worse than that — it is impossible in principle. One cannot have a ruleset which, in finite time, correcly finds all unreachable code. This is equivalent to the halting problem. I'm going to change the article to reflect this, once I can figure out how to do so without disrupting the narrative.