A Galois connection between Turing jumps and limits

Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this another problem that characterizes the functions that are computab...

Full description

Bibliographic Details
Published in:	Logical Methods in Computer Science
Main Author:	Vasco Brattka
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2018-08-01
Subjects:	mathematics - logic computer science - logic in computer science
Online Access:	https://lmcs.episciences.org/4287/pdf

Similar Items

On the algebraic structure of Weihrauch degrees
by: Vasco Brattka, et al.
Published: (2018-10-01)

Reachability for infinite time Turing machines with long tapes
by: Merlin Carl, et al.
Published: (2020-04-01)

Ambiguity of {\omega}-Languages of Turing Machines
by: Olivier Finkel
Published: (2014-08-01)

Alternating Turing machines for inductive languages
by: Daniel M Leivant
Published: (2013-10-01)

Strong Turing Degrees for Additive BSS RAM's
by: Christine Gaßner
Published: (2013-12-01)

A duality theoretic view on limits of finite structures: Extended version
by: Mai Gehrke, et al.
Published: (2022-01-01)

Random strings and tt-degrees of Turing complete C.E. sets
by: Mingzhong Cai, et al.
Published: (2014-09-01)

Axiomatization of betweenness in order-theoretic trees
by: Bruno Courcelle
Published: (2021-02-01)

A Proof of Kamp's theorem
by: Alexander Rabinovich
Published: (2014-02-01)

A modular construction of type theories
by: Frédéric Blanqui, et al.
Published: (2023-02-01)

A Cubical Language for Bishop Sets
by: Jonathan Sterling, et al.
Published: (2022-03-01)

A Coalgebraic Approach to Dualities for Neighborhood Frames
by: Guram Bezhanishvili, et al.
Published: (2022-07-01)

Applicable Mathematics in a Minimal Computational Theory of Sets
by: Arnon Avron, et al.
Published: (2018-10-01)

Theories of real addition with and without a predicate for integers
by: Alexis Bès, et al.
Published: (2021-05-01)

Overlap Algebras: a Constructive Look at Complete Boolean Algebras
by: Francesco Ciraulo, et al.
Published: (2020-02-01)

Products of effective topological spaces and a uniformly computable Tychonoff Theorem
by: Robert Rettinger, et al.
Published: (2013-11-01)

A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semantics
by: Karim Nour, et al.
Published: (2017-08-01)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
by: Thomas Powell
Published: (2024-01-01)

The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$
by: Dag Normann
Published: (2018-03-01)

Strong negation in the theory of computable functionals TCF
by: Nils Köpp, et al.
Published: (2025-04-01)

Completions of Kleene's second model
by: Sebastiaan A. Terwijn
Published: (2025-06-01)

The Pebble-Relation Comonad in Finite Model Theory
by: Yoàv Montacute, et al.
Published: (2024-05-01)

Bounded variation and the strength of Helly's selection theorem
by: Alexander P. Kreuzer
Published: (2014-12-01)

On the relative proof complexity of deep inference via atomic flows
by: Anupam Das
Published: (2015-03-01)

Classical propositional logic and decidability of variables in intuitionistic propositional logic
by: Hajime Ishihara
Published: (2014-08-01)

Borel-piecewise continuous reducibility for uniformization problems
by: Takayuki Kihara
Published: (2017-04-01)

Knowledge Spaces and the Completeness of Learning Strategies
by: Stefano Berardi, et al.
Published: (2014-02-01)

Expansions of MSO by cardinality relations
by: Alexis Bès
Published: (2013-12-01)

Monadic second-order definable graph orderings
by: Achim Blumensath, et al.
Published: (2014-01-01)

Bijective proofs for Eulerian numbers of types B and D
by: Luigi Santocanale
Published: (2023-03-01)

An Analysis of Tennenbaum's Theorem in Constructive Type Theory
by: Marc Hermes, et al.
Published: (2024-03-01)

Computing with Infinite Objects: the Gray Code Case
by: Dieter Spreen, et al.
Published: (2023-07-01)

On the logical complexity of cyclic arithmetic
by: Anupam Das
Published: (2020-01-01)

Ordered Models of the Lambda Calculus
by: Antonino Salibra, et al.
Published: (2013-12-01)

Computability of 1-manifolds
by: Konrad Burnik, et al.
Published: (2014-06-01)

Unsolvability Cores in Classification Problems
by: Hermann K. -G. Walter, et al.
Published: (2014-06-01)

Total Representations
by: Victor Selivanov
Published: (2013-06-01)

Thin Games with Symmetry and Concurrent Hyland-Ong Games
by: Simon Castellan, et al.
Published: (2019-03-01)

Deciding Equations in the Time Warp Algebra
by: Sam van Gool, et al.
Published: (2024-01-01)

On Small Types in Univalent Foundations
by: Tom de Jong, et al.
Published: (2023-05-01)