Talk:Abstract machine

From Wikipedia, the free encyclopedia

This article was originally based on material from the Free On-line Dictionary of Computing, which is licensed under the GFDL.

Contents

[edit] 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.

[edit] 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?

[edit] 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

[edit] 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)

[edit] 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)