1987 | OriginalPaper | Buchkapitel
Stack Machines
verfasst von : Prof. Dr. Klaus Weihrauch
Erschienen in: Computability
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Since tape machines or one tape Turing machines are not very appropriate for practical programming of word functions, in this chapter we introduce a generalization of the register machines from numbers to words, the stack machines. Stack machines, especially the generalized stack machines, are a very useful and natural tool for formulating algorithms which operate on words. We shall prove that the stack machine computable word functions are exactly the (tape) computable word functions.