Share Email Print

Proceedings Paper

Perspex machine: VI. A graphical user interface to the perspex machine
Author(s): Christopher J. A. Kershaw; 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 is a continuous, super-Turing machine which, in previous work, was simulated programatically on a digital computer in the AI language Pop11. Here we present a C++ simulation of the perspex machine, along with a graphical user interface, that can be used to implement, edit, visualise, instrument, and run perspex programs interactively. The interface uses a number of different projections to make 4D perspex-space more accessible to the user. We also present a new proof of the Walnut Cake Theorem that has much weaker conditions than the previous proof and is, therefore, much more widely applicable. It predicts non-monotonicities in numerical algorithms with sub-quadratic convergence.

Paper Details

Date Published: 18 January 2006
PDF: 10 pages
Proc. SPIE 6066, Vision Geometry XIV, 60660S (18 January 2006); doi: 10.1117/12.637554
Show Author Affiliations
Christopher J. A. Kershaw, 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