Comments on: Hard problems and the Temple of Complexity http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/ Thoughts of a minor lunatic Wed, 07 Jan 2009 20:55:33 +0000 http://wordpress.org/?v=2.7 hourly 1 By: Ian Rae http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/comment-page-1/#comment-6444 Ian Rae Thu, 27 Apr 2006 15:53:33 +0000 http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/#comment-6444 Another dimension of complexity is the changing nature of requirements. Being asked to build something is generally not "hard". But when they change their mind six months in, then nine months, and so on, you have a hard puzzle on your hands. Keep building on the original (and now inadequate) foundation? Redo the entire foundation? Redo the foundation with even additional flexibility in expectation of further requirements changes? Redo part and add a mapping layer?? Another dimension of complexity is the changing nature of requirements. Being asked to build something is generally not “hard”. But when they change their mind six months in, then nine months, and so on, you have a hard puzzle on your hands. Keep building on the original (and now inadequate) foundation? Redo the entire foundation? Redo the foundation with even additional flexibility in expectation of further requirements changes? Redo part and add a mapping layer??

]]> By: Aristotle Pagaltzis http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/comment-page-1/#comment-6269 Aristotle Pagaltzis Mon, 17 Apr 2006 03:35:53 +0000 http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/#comment-6269 I agree on all counts and rather enjoyed this article, but you slipped a really embarrassing little mistake in there: P or NP complete There is no such thing as “P complete.� There is only “NP-complete,� which is the name of a special class of isomorphic NP problems. I was going to break it down a little more here, but then I noticed you would be better served to just look up the Wikipedia articles on NP-complete and complexity theory. I agree on all counts and rather enjoyed this article, but you slipped a really embarrassing little mistake in there:

P or NP complete

There is no such thing as “P complete.� There is only “NP-complete,� which is the name of a special class of isomorphic NP problems. I was going to break it down a little more here, but then I noticed you would be better served to just look up the Wikipedia articles on NP-complete and complexity theory.

]]> By: petrilli http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/comment-page-1/#comment-6244 petrilli Sun, 16 Apr 2006 21:44:45 +0000 http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/#comment-6244 There are a staggeringly few number of "problems" in the IT world that haven't been solved repeatedly -- some even tens of thousands of times. This is why I argue that the laughable notion that they are "hard problems" is born more by a desire to feel important than by any real innate difficulty in the problem itself. There are hard problems, but we drain our resources and intellectual capital into many places where we do nothing truly hard. Often things become hard because we attempt to make everyone happy. Such things, bred of strange psychosis in the human animal, are disaster to accomplishing anything. There are a staggeringly few number of “problems” in the IT world that haven’t been solved repeatedly—some even tens of thousands of times. This is why I argue that the laughable notion that they are “hard problems” is born more by a desire to feel important than by any real innate difficulty in the problem itself.

There are hard problems, but we drain our resources and intellectual capital into many places where we do nothing truly hard. Often things become hard because we attempt to make everyone happy. Such things, bred of strange psychosis in the human animal, are disaster to accomplishing anything.

]]> By: JT http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/comment-page-1/#comment-6241 JT Sun, 16 Apr 2006 15:43:53 +0000 http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/#comment-6241 The easist problems are: --> ones that have been solved for already --> easy to write down on one piece of paper --> correcting past mistakes --> utility based in nature The hardest problems: --> the most difficult to put into word --> subject to the most highly unique aspects of the customer --> attempt to solve for people power (aka "wetware" The easist problems are:—> ones that have been solved for already—> easy to write down on one piece of paper—> correcting past mistakes—> utility based in nature

The hardest problems:—> the most difficult to put into word—> subject to the most highly unique aspects of the customer —> attempt to solve for people power (aka “wetware”

]]> By: petrilli http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/comment-page-1/#comment-6239 petrilli Sun, 16 Apr 2006 15:02:00 +0000 http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/#comment-6239 Let's tag this one k-rad k00l. Let’s tag this one k-rad k00l.

]]> By: Chowdary http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/comment-page-1/#comment-6229 Chowdary Sun, 16 Apr 2006 08:25:04 +0000 http://blog.amber.org/2006/04/14/hard-problems-and-the-temple-of-complexity/#comment-6229 Funny how Ruby or rails can't address them.. Welcome to THE Real World.... Mr. Know-no-thing(TM) sy What are those tags? Is'nt it just BALONEY? Why can't I tag your blogs.... Who's tagging your blogs????? Why? Funny how Ruby or rails can’t address them..

Welcome to THE Real World….
Mr. Know-no-thing™ sy

What are those tags? Is’nt it just BALONEY?

Why can’t I tag your blogs….

Who’s tagging your blogs????? Why?

]]>