送交者: insight 于 2006-2-23, 02:00:59:

回答: non-deteministic turing machine and deterministic turing machine 由 steven 于 2006-2-23, 01:45:07:

based on the top-down model using algorithms. It is from knowables to knowables. Period.

• it doesn't matter what you said, top-down/bottom-up both - steven (36 bytes) 2006-2-23, 11:58:33
  • why? Let us know why? - insight (0 bytes) 2006-2-23, 18:30:45

加跟贴