A language for easy and efficient modeling of Turing machines

DOI10.1080/10002007088537484MaRDI QIDQ2478283zbMATH OpenOpenAlexFDO

Authors Pinaki Chakraborty

Publication date 18 March 2008

Published in Progress in Natural Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10002007088537484

zbMATH Keywords

compilerinterpretersimulationTuring machine

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• Simple programming languages and restricted classes of Turing machines
• scientific article; zbMATH DE number 4049055
• An algebraic model for programming languages
• A high-level language for modeling algorithms and their properties
• Language of Turing machines from the point of view of optimization
• Formalization of the computational theory of a Turing complete functional language model
• scientific article; zbMATH DE number 4203724
• A theoretical model of a high-level programming language

Cited in

(1)

• scientific article; zbMATH DE number 527373 (Why is no real title available?)

This page was built for publication: A language for easy and efficient modeling of Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2478283)