Results 1 to 10 of about 120,189 (290)
A Galois connection between Turing jumps and limits [PDF]
Logical Methods in Computer Science, 2018 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
Vasco Brattka
doaj +3 more sources
Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$ [PDF]
Logical Methods in Computer Science, 2014 By the Riesz representation theorem using the Riemann-Stieltjes integral, linear continuous functionals on the set of continuous functions from the unit interval into the reals can either be characterized by functions of bounded variation from the unit ...
Klaus Weihrauch, Tahereh Jafarikhah
doaj +4 more sources
Logical Methods in Computer Science, 2013 This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two ...
Martin Avanzini, Georg Moser
doaj +3 more sources
On the Weak Computability of Continuous Real Functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there is a Turing ...
Matthew S. Bauer, Xizhong Zheng
doaj +4 more sources
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation [PDF]
Logical Methods in Computer Science, 2021 We propose a simple imperative programming language, ERC, that features arbitrary real numbers as primitive data type, exactly. Equipped with a denotational semantics, ERC provides a formal programming language-theoretic foundation to the algorithmic ...
Sewon Park +9 more
doaj +4 more sources
Products of effective topological spaces and a uniformly computable Tychonoff Theorem [PDF]
Logical Methods in Computer Science, 2013 This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces.
Robert Rettinger, Klaus Weihrauch
doaj +4 more sources
Effective zero-dimensionality for computable metric spaces [PDF]
Logical Methods in Computer Science, 2015 We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent.
Robert Kenny
doaj +3 more sources
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs [PDF]
Logical Methods in Computer Science, 2017 We discuss possibilities of application of Numerical Analysis methods to proving computability, in the sense of the TTE approach, of solution operators of boundary-value problems for systems of PDEs.
Svetlana Selivanova, Victor Selivanov
doaj +3 more sources
Foundations of Online Structure Theory II: The Operator Approach [PDF]
Logical Methods in Computer Science, 2021 We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory.
Rod Downey +2 more
doaj +1 more source
Computable analysis and notions of continuity in Coq [PDF]
Logical Methods in Computer Science, 2021 We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in the sense of ...
Florian Steinberg +2 more
doaj +1 more source