Results 11 to 20 of about 23,100,798 (257)
Computable Frames in Computable Banach Spaces [PDF]
International Journal of Analysis and Applications, 2016 We develop some parts of the frame theory in Banach spaces from the point of view of Computable Analysis. We define computable M-basis and use it to construct a computable Banach space of scalar valued sequences.
S.K. Kaushik, Poonam Mantry
doaj +4 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
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 +1 more source
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 +1 more source
Logical Methods in Computer Science, 2013 Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space).
Victor Selivanov
doaj +1 more source
Weihrauch complexity in computable analysis [PDF]
, 2021 We provide a self-contained introduction into Weihrauch complexity and its applications to computable analysis.
Vasco Brattka +2 more
core +1 more source
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 +1 more source
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 +1 more source
Turing machines on represented sets, a model of computation for Analysis [PDF]
Logical Methods in Computer Science, 2011 We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis.
Nazanin Tavana, Klaus Weihrauch
doaj +1 more source