Share Email Print

Proceedings Paper

Perspex machine: V. Compilation of C programs
Author(s): Matthew P. Spanner; James A. D. W. Anderson
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The perspex machine arose from the unification of the Turing machine with projective geometry. The original, constructive proof used four special, perspective transformations to implement the Turing machine in projective geometry. These four transformations are now generalised and applied in a compiler, implemented in Pop11, that converts a subset of the C programming language into perspexes. This is interesting both from a geometrical and a computational point of view. Geometrically, it is interesting that program source can be converted automatically to a sequence of perspective transformations and conditional jumps, though we find that the product of homogeneous transformations with normalisation can be non-associative. Computationally, it is interesting that program source can be compiled for a Reduced Instruction Set Computer (RISC), the perspex machine, that is a Single Instruction, Zero Exception (SIZE) computer.

Paper Details

Date Published: 18 January 2006
PDF: 12 pages
Proc. SPIE 6066, Vision Geometry XIV, 60660A (18 January 2006); doi: 10.1117/12.637553
Show Author Affiliations
Matthew P. Spanner, The Univ. of Reading (United Kingdom)
James A. D. W. Anderson, The Univ. of Reading (United Kingdom)

Published in SPIE Proceedings Vol. 6066:
Vision Geometry XIV
Longin Jan Latecki; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top