Content deleted Content added
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Tag: |
|||
| (9 intermediate revisions by 3 users not shown) | |||
Line 1:
{{WikiProject banner shell|
{{WikiProject Computing}}
}}
== 2007-02-1 Automated pywikipediabot message ==
Line 52 ⟶ 53:
'''I recommend that this subsection be torn out, and replaced with a 'See also Cyclomatic Complexity' '''
Thanks, [[Special:Contributions/140.180.249.29|140.180.249.29]] ([[User talk:140.180.249.29|talk]]) 16:48, 19 June 2014 (UTC)
: The wikipedia articles in this area sucked probably still need work, but the problem is not what you write above. (In simple words, you are wrong.) The actual problem is that notion of reducibility used by B-J and that used by Kosaraju and McCabe are different! B-J allows the introduction of extra variables (and extra predicates using them), while K and McCabe do not allow this. I've expanded the article on B-J to explain this better, I hope. Kozen's 2008 paper tile "The Böhm–Jacopini Theorem Is False, Propositionally" says it all, really. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 20:38, 16 July 2014 (UTC)
: In your transformation, you have duplicated code (the <code>i=-1;</code> block) and you have also introduced a new variable <code>ii</code> which you not only assign to, but also test. None of these transformations is allowed under the McCabe or Kosaraju reducibility rules. They are allowed under the Böhm and Jacopini reducibility rules. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 05:59, 17 July 2014 (UTC)
: I do agree however with you first point, namely that I can't see much commonality between the notions mentioned by Brooks and the one by McCabe. I've therefore added a split template to the article. I don't know much about the Brooks notion, but I suspect it could be merged with [[accidental complexity]] and the page titled [[essential complexity and accidental complexity]] or something like that. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 05:55, 17 July 2014 (UTC)
== Prior work ==
I'm surprised that a journal published McCabe's paper (in 1976) without noticing that his section VI (about the irreducible graphs), minus the proposed measure, duplicated the [more extensive] findings of the compiler guys, published some 4 years before, namely ''Flow graph reducibility'' by Hecht and Ullman, which appeared both at STOC'72 and also in SIAM J. of Comput. in the same year ({{doi|10.1145/800152.804919}} and {{doi|10.1137/0201014}}). Hecht and Ullman introduce there their "Collapsibility" which does what McCabe's reduction does. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 02:06, 21 July 2014 (UTC)
| |||