Share Email Print
cover

Proceedings Paper

Perspex machine II: visualization
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The perspex machine is a theoretical computer that arose from the unification of the Turing machine with projective geometry. It is super-Turing because it can operate on any, or all, numbers on the real number line, for example, along a geometrical ray. It can operate on individual Turing-incomputable numbers and on sets of numbers with the cardinality of the continuum (real number line). This exceeds the cardinality of the natural numbers, that is, the number of symbols accessible to a Turing machine. The perspex machine can compute continuous events in addition to discrete ones. We suppose this gives it enough power to describe the operation of the physical universe, including the operation of minds. We review the perspex machine and improve it by reducing its halting conditions to one condition. We introduce a data structure that can accelerate a wide class of perspex programs. We show how the perspex can be visualised as a tetrahedron, artificial neuron, computer program, and as a geometrical transformation. We discuss the temporal properties of the perspex machine, dissolve the famous time travel paradox, and present a hypothetical time machine. Finally, we discuss some mental properties and show how the perspex machine solves the mind-body problem and, specifically, how it provides one physical explanation for the occurrence of paradigm shifts.

Paper Details

Date Published: 17 January 2005
PDF: 12 pages
Proc. SPIE 5675, Vision Geometry XIII, (17 January 2005); doi: 10.1117/12.580664
Show Author Affiliations
James A. D. W. Anderson, Univ. of Reading (United Kingdom)


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

© SPIE. Terms of Use
Back to Top