Robustness of non-computability

09/30/2021
by   Daniel S. Graça, et al.
0

Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to understand whether it is possible to obtain systems with super-Turing capabilities which also have other desirable properties such as robustness to perturbations. In this paper we introduce a framework for analyzing whether a non-computability result is robust over continuous spaces. Then we use this framework to study the degree of robustness of several non-computability results which involve the wave equation, differentiation, and basins of attraction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2021

What can we learn from universal Turing machines?

In the present paper, we construct what we call a pedagogical universal ...
research
04/20/2023

Computational Power of Particle Methods

The computational power of a compute model determines the class of probl...
research
08/28/2023

A conservative Turing complete S^4 flow

We present a Turing complete, volume preserving, smooth flow on the 4-sp...
research
03/11/2019

The relationship between word complexity and computational complexity in subshifts

We prove several results about the relationship between the word complex...
research
07/03/2012

Alan Turing's Legacy: Info-Computational Philosophy of Nature

Alan Turing's pioneering work on computability, and his ideas on morphol...
research
07/12/2021

On the undecidability of the Panopticon detection problem

The Panopticon (which means "watcher of everything") is a well-known str...

Please sign up or login with your details

Forgot password? Click here to reset