Building a model of a useful Turing machine

DOI10.1016/S0898-1221(99)00319-3MaRDI QIDQ1975337zbMATH OpenWikidataFDO

Authors Jerzy A. Piotrowski

Publication date 9 April 2000

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(99)00319-3

zbMATH Keywords

Turing machineuniversal computer

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 2150282
• A universal machine without change of state
• scientific article; zbMATH DE number 515723
• A simple universal Turing machine for the game of life Turing machine

Cites work

• A functional model of a simplified sequential machine
• Finite combinatory processes—formulation
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Sequential and data flow models of processing

Cited in

(6)

• A universal machine without change of state
• Universality in two dimensions
• scientific article; zbMATH DE number 527373 (Why is no real title available?)
• scientific article; zbMATH DE number 1543327 (Why is no real title available?)
• A survey of state vectors
• Simulation of circuits of functional elements by the universal Turing machine

Describes a project that uses

Uses Software

• Miranda

This page was built for publication: Building a model of a useful Turing machine

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