Sunday, November 22, 2009

Turing machine: secuential

Turing machine is the most simple theory to explain how computers solve problems: they solve them sequentially.

Even people solve problems sequentially. Of course, many can people can work in parallel to solve a common problem for them, but each one does its work sequentially. Even if you write with one hand, and at the same time play piano with another, each hand is doing a sequential work!

Looking at these examples, it feels funny to use Java Threads for parallelism, but sometimes that is not so simple enough.

Even when we are designing a diagram, or if defining dependences, or writing a use case, we always think sequentially.

Is sequentiality the most basic feature of solving problems? Stored data is a basic feature too, but am interesting in knowing more about it, although it seems like a law.

No comments:

Post a Comment