Towards computable analysis on the generalised real line

DOI10.1007/978-3-319-58741-7_24zbMath1496.03174arXiv1704.02884OpenAlexW2605868949MaRDI QIDQ2011660

Hugo Nobrega, Lorenzo Galeotti

Publication date: 4 August 2017

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

Mathematics Subject Classification ID

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

Related Items (2)

Effectivity and reducibility with ordinal Turing machines ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closed choice and a uniform low basis theorem
• Ordinal machines and admissible recursion theory
• Dedekind cuts of Archimedean complete ordered abelian groups
• The computational strengths of \(\alpha\)-tape infinite time Turing machines
• Effective Choice and Boundedness Principles in Computable Analysis
• Generalized Effective Reducibility
• A Candidate for the Generalised Real Line
• Turing Computations On Ordinals
• On the topological aspects of the theory of represented spaces

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