A practical turing machine representation

Authors:
Robert M. Nirenberg
Affiliations:
Department of Computer Science, CCNY
Venue:
ACM SIGACT News
Year:
1986

Citing 3
Cited 0

Experiments with a supercompiler

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
The mapping of the refal machine onto a von neumann machine

The mapping of the refal machine onto a von neumann machine
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	0.01

Visualization

Abstract

A tool is presented for research work on Turing machines and other abstract programming models. This tool is based on the use of the Recursive Function Algorithmic Language (Refal). A short background of this language is presented. Examples are given as to how this language may be useful for running simulations of Turing machines, and how it may be useful for the researcher into abstract machines.