Towards computable analysis on the generalised real line

DOI10.1007/978-3-319-58741-7_24zbMATH Open1496.03174arXiv1704.02884OpenAlexW2605868949MaRDI QIDQ2011660FDOQ2011660

Authors: Lorenzo Galeotti, Hugo Nobrega 

Publication date: 4 August 2017

Abstract: In this paper we use infinitary Turing machines with tapes of length $kappa$ and which run for time $kappa$ as presented, e.g., by Koepke & Seyfferth, to generalise the notion of type two computability to $2^{kappa}$, where $kappa$ is an uncountable cardinal with $kapp{a}^{<kappa}=kappa$. Then we start the study of the computational properties of $mathbb{R}_{k}appa$, a real closed field extension of $mathbbR$ of cardinality $2^{kappa}$, defined by the first author using surreal numbers and proposed as the candidate for generalising real analysis. In particular we introduce representations of $mathbb{R}_{k}appa$ under which the field operations are computable. Finally we show that this framework is suitable for generalising the classical Weihrauch hierarchy. In particular we start the study of the computational strength of the generalised version of the Intermediate Value Theorem.

Full work available at URL: https://arxiv.org/abs/1704.02884

Recommendations

• A domain-theoretic approach to computability on the real line
• On the Computable Theory of Bounded Analytic Functions
• On the extension of computable real functions
• Computability on reals, infinite limits and differential equations
• scientific article; zbMATH DE number 1191234
• A new approach to computability over the reals
• scientific article; zbMATH DE number 176208
• scientific article; zbMATH DE number 2183393
• On approximate and algebraic computability over the real numbers
• On some computability notions for real functions

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Turing machines and related notions (03D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective Choice and Boundedness Principles in Computable Analysis
• Closed choice and a uniform low basis theorem
• Title not available (Why is that?)
• Ordinal machines and admissible recursion theory
• Turing Computations On Ordinals
• Title not available (Why is that?)
• Dedekind cuts of Archimedean complete ordered abelian groups
• On the topological aspects of the theory of represented spaces
• The computational strengths of \(\alpha\)-tape infinite time Turing machines
• Generalized effective reducibility
• A candidate for the generalised real line

Cited In (3)

• A candidate for the generalised real line
• Effectivity and reducibility with ordinal Turing machines
• Weihrauch Complexity in Computable Analysis

This page was built for publication: Towards computable analysis on the generalised real line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011660)