Talk:Abstract machine

About "Parallel TE abstract machine"

Classical abstract machines and automata theory lead with the SEQUENCIAL approach. If we open here to concurrent/parellel models, it will be add a "new universe", and it is not closed to the usual approaches: only sequential is a "well closed" theory. Communicating sequential processes (CSP) is a abstract machine?? We can show relationships... but caution with a NEW TAXONOMY (see Flynn's Taxonomy and others). -- Krauss octuber 2006.

Olds

Question is a abstract machine which has an implementation (i.e. a virtual machine) not abstract anymore? What about the Warren Abstract Machine (WAM) then?

What is the precise difference in the definition between abstract machine and virtual machine?

Model of Computation and Abstract Machine

Unless I am radically mistaken at how broad the notion of Abstract machine is not every model of computation is going to be an abstract machine. For instance models of computation allowing computation in structures other than the integers (like the reals) or other abstract notions that don't involve the idea of machine at any point.

Do recursive functions even count as a model of computation? They are defined as just the smallest class of functions containing certain basic functions and closed under mu recursion. If I haven't gotten around to doing it yet could someone else who knows what they are talking about take a stab at making a seperate page for Model of Computation

Logicnazi

Source for taxonomy

Where does the taxonomy in section 1 come from? The use of Linnean ranks and the numbering are not standard in the field of automata theory. Gdr 13:38, 8 July 2007 (UTC)

CA

Don't cellular automata, such as Conway's Game of Life, deserve some mention here? I mean, the Game of Life is simple, somewhat well known, and Turing-complete. —Preceding unsigned comment added by Jesin (talk • contribs) 02:46, 24 February 2008 (UTC)

Abstract Machine

I propose we reword the old second paragraph:
In the theory of computation, abstract machines are often used in thought experiments regarding computability or to analyze the complexity of algorithms (see computational complexity theory). A typical abstract machine consists of a definition in terms of input, output, and the set of allowable operations used to turn the former into the latter. The best-known example is the Turing machine. (Italics mine.)

Doesn't "or" mean "in other words" here? It could mean as in "either or"?

Does "former" refer to "thought experiment"? And what does "later" refer to? "Later" refers to the completed model, the abstract machine itself?

May we say, (and I attempt to copy the exact idea):
In the theory of computation, abstract machines are used in thought experiments regarding computability in general, and in order to analyze the complexity of algorithms in particular. (See computational complexity theory). To analyze an algorithm an abstract machine must first be defined (typically terms of input, output, and the set of allowable operations). The abstract machine then becomes the theoretical platform from which to analyze algorithms. The best-known example of an abstract machine is the Turing machine.
CpiralCpiral 04:00, 13 September 2009 (UTC)