Continuous-space model of computation is Turing universal

Thomas J. Naughton

doi:10.1117/12.409212

17 November 2000 Continuous-space model of computation is Turing universal

Thomas J. Naughton

Proceedings Volume 4109, Critical Technologies for the Future of Computing; (2000) https://doi.org/10.1117/12.409212
Event: International Symposium on Optical Science and Technology, 2000, San Diego, CA, United States

Abstract

Our model of computation (theoretical machine) was designed for the analysis of analog Fourier optical processors, its basic data unit being a continuous image of unbounded resolution. In this paper, we demonstrate the universality of our machine by presenting a framework for arbitrary Turing machine simulation. Computational complexity benefits are also demonstrated by providing a O(log₂n) algorithm for a search problem that has a lower bound of n - 1 on a Turing machine.

Citation Download Citation

Thomas J. Naughton "Continuous-space model of computation is Turing universal", Proc. SPIE 4109, Critical Technologies for the Future of Computing, (17 November 2000); https://doi.org/10.1117/12.409212

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available