送交者: steven 于 2006-1-18, 01:51:59:

回答: 另外， 由 虎子 于 2006-1-18, 00:22:29:

except maybe the quantum computing, and the proof of its efficiency. Most of the fundamental computational problems we a couple decays ago remains the same. We still cannot effectively solve NP problems, and we still don't know if NP = P or not. The theory behind all this moves quit slowly, and there isn't much break through.

The goal for engineering is not trying to solve those fundamental problems, but make those exsiting solutions avaliable to those who need them in a ecnomoically viable way.

There are only a couple Turing awards given to Engineers including Ken Thomson, Dennis Ritchie for inventing Unix; Corbato for CTSS and multice; Kay, Dahl and Nygaard for OO; Cerf and Kahn for TCP/IP. All the rest are theory works. After all Turing is a theory guy.

所有跟贴:

- if N = 1, then NP = P! haha... -
**BerkeleyWolf**(78 bytes)*2006-1-18, 11:59:04*- here is my proof. -
**steven**(161 bytes)*2006-1-18, 13:18:26* - Give me a Turing award, fast ! -
**BerkeleyWolf**(0 bytes)*2006-1-18, 11:59:26*- A turing award is far less enough for prooging P=?NP -
**gentoo**(0 bytes)*2006-1-18, 15:34:07*- give me a turing and three Nobel in physics, chem, eco, as well ! -
**BerkeleyWolf**(0 bytes)*2006-1-18, 17:05:57*

- give me a turing and three Nobel in physics, chem, eco, as well ! -

- A turing award is far less enough for prooging P=?NP -

- here is my proof. -