English 中文(简体)
Relationships between complexity theory and software engineering? [closed]
原标题:

We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.

Closed 6 years ago.

I m interested to know if there is any literature out there on the relationship of complexity theory (emergence, complex systems, evolution) and software development processes. I read somewhere that SCRUM philosophy came out of the theory of punctuated equilibrium in evolution theory. Are there any additional studies/researches on this subject?

Thanks!

最佳回答

There s a slightly tongue-in-cheek book called Systemantics. Because a software program is a type of system, its observations are applicable to software: for example,

  • The bigger the system, the narrower and more specialized the interface with individuals.
  • A complex system cannot be "made" to work. It either works or it doesn t.
  • A simple system, designed from scratch, sometimes works.
  • Some complex systems actually work.
  • A complex system that works is invariably found to have evolved from a simple system that works.
  • A complex system designed from scratch never works and cannot be patched up to make it work. You have to start over, beginning with a working simple system.
问题回答

There interesting blog posts by Jurgen Appelo of NOOP.NL fame, which are related to application of complexity theory to software engineering and project management:

These can be helpful in researching this topic.





相关问题
What are the differences between NP, NP-Complete and NP-Hard?

What are the differences between NP, NP-Complete and NP-Hard? I am aware of many resources all over the web. I d like to read your explanations, and the reason is they might be different from what s ...

upper bound, lower bound

What does it mean to prove an upper bound or lower bound to an algorithm?

Worst case time complexity

i have an algorithm that searches into a directory and search for all the text files in that directory and any sub-directory. Assuming i do not know how many sub-directories and sub-sub directories ...

Best-case Running-time to solve an NP-Complete problem?

What is the fastest algorithm that exists up with to solve a particular NP-Complete problem? For example, a naive implementation of travelling salesman is O(n!), but with dynamic programming it can be ...

Complexity in Prolog programs?

In Prolog, problems are solved using backtracking. It s a declarative paradigm rather than an imperative one (like in C, PHP or Python). In this kind of languages is it worth to think in terms of ...

Why is the complexity of A* exponential in memory?

Wikipedia says on A* complexity the following (link here): More problematic than its time complexity is A*’s memory usage. In the worst case, it must also remember an exponential number of ...

热门标签