research "state machine" in cp.com. focus on the first 4 pages. come back later..
- State Machine Design in C
- State Machine Design in C++
- State Machines, in C++
- Controlling Multiple Forms with a Finite State Machine gggustafson
- A C# Turing Machine
- Generic Finite State Machine Revisited
- Finite State Machine and Multithreading using .NET
- Generic DFA State Machine for .NET
- Configuring Simple State Machines
- A Simple State Machine
- The State Design Pattern vs. State Machine
- Configuring Simple State Machines
- C++ State Machine with Threads
- A .NET State Machine Toolkit - Part I
- A .NET State Machine Toolkit - Part II
- A .NET State Machine Toolkit - Part III
Every computer is equivalent to a Turing Machine, and conversely any Turing Machine can compute anything any other computer can. Perhaps this is one of the more astonishing facts about them: being a really simple machine, a Turing Machine can theoretically, given enough time and resources, run anything you can run on a computer, any algorithm. A small mechanical Turing Machine, such as the one further described, can totally emulate the computer where you are reading this article right now, all the software, operational system etc down to the functionality of the silicon chips. To be more precise, usually Turing Machines are used as basic computational device to which other systems/machines are compare to, so if we say the former is compatible to a Turing Machine, then we mean it has the power to calculate or execute any computable function.
Create loose coupled States using a Finite State Automation (FSM) model.
How to use the State Design Pattern when compared to State Machines, Switch statements, or If statements.
No comments:
Post a Comment