The USD 25000, Wolfram Prize for the following question "if someone could prove or disprove that a very simple theoretical computer called a Turing machine, with just six variations in its rule base, could perform all known computations, making it a "universal computer." - The universality of Turing machine has been proved by Alex Smith, 20, an undergraduate student studying electronic and computer engineering at the University of Birmingham in the UK.
It proves (still mathematicians have to thrash it out) that simple rules can indeed produce complex systems - which is what most of Wolfram's work - the creator of Mathematica, has been. Life wants to emerge - Nature wants to create continuously - unless we let her do it.
Well is there a lesson for the corporate world - yes - find out the rules of work that help emerge ideas and solutions for long term benefits
My Book on Strategic Decision Making
Applying the Analytic Hierarchy Process
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment