Computation as uncertainty reduction: a simplified order-theoretic framework

06/28/2022
by   Pedro Hack, et al.
0

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic structures have proven to be useful. Here, we discuss the mathematical structure needed to define computability using order-theoretic concepts. In particular, we introduce a more general framework and discuss its limitations compared to the previous one in domain theory. We expose four features in which the stronger requirements in the domain-theoretic structure allow to improve upon the more general framework: computable elements, computable functions, model dependence of computability and complexity theory. Crucially, we show computability of elements in uncountable spaces can be defined in this new setup, and argue why this is not the case for computable functions. Moreover, we show the stronger setup diminishes the dependence of computability on the chosen order-theoretic structure and that, although a suitable complexity theory can be defined in the stronger framework and the more general one posesses a notion of computable elements, there appears to be no proper notion of element complexity in the latter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/28/2021

Fixpoints and relative precompleteness

We study relative precompleteness in the context of the theory of number...
research
06/29/2022

On the relation of order theory and computation in terms of denumerability

Computability on uncountable sets has no standard formalization, unlike ...
research
10/31/2020

Partial Functions and Recursion in Univalent Type Theory

We investigate partial functions and computability theory from within a ...
research
05/11/2023

How Much Partiality Is Needed for a Theory of Computability?

Partiality is a natural phenomenon in computability that we cannot get a...
research
05/02/2022

Relatively acceptable notation

Shapiro's notations for natural numbers, and the associated desideratum ...
research
07/24/2023

The complexity of completions in partial combinatory algebra

We discuss the complexity of completions of partial combinatory algebras...
research
01/17/2018

Finitary-based Domain Theory in Coq: An Early Report

In domain theory every finite computable object can be represented by a ...

Please sign up or login with your details

Forgot password? Click here to reset