Talk:Stack Machine: Difference between revisions

 

: The equivalence to a turing machine can be seen if you think about the two stacks as being the tape of the turing machine. In order to move left, a value is popped off the left-stack and pushed onto the right stack and likewise to move right. Writing to the tape accomplished by popping a value off one stack and pushing a different value onto the same stack. Finding references for this is trivial (Kozen's purple book and The Dragon Book come to mind) but I'm away from my bookshelf for the week. This weekend I'll clean up the entries to make the distinction clear and put some references to it after I return. I've personally can't recall ever having heard the term [[Queue Machine]], though that doesn't mean the term is invalid. It just means that I hope to see some good references on your page. Perhaps that is the proper term for a fsm augmented with more than one stack. [[User:Nutmegmagi|Nutmegmagi]] ([[User talk:Nutmegmagi|talk]]) 20:43, 24 December 2008 (UTC)