Completeness of a Visual Computation Model

Authors

Timothy B. Brown, Washington University in St Louis

Document Type

Technical Report

Publication Date

1993

Filename

WUCS-93-53.pdf

Technical Report Number

WUCS-93-53

Abstract

Visual programming is the specification of computational processes using diagrams and icons. Traditional computation models such as Turing machines and lambda-calculus, which are based on one-dimensional text strings, are not suitable for visual programming languages. We propose a two-dimensional computation model that requires no text. We also prove that the model is computationallhy complete, i.e., that the model has the same computational power as Turing machines.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7TX3CQ3

Recommended Citation

Brown, Timothy B., "Completeness of a Visual Computation Model" Report Number: WUCS-93-53 (1993). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/548