Results 1 to 10 of about 10,740 (264)
Computability in Harmonic Analysis [PDF]
Foundations of Computational Mathematics, 2021 We study the question of constructive approximation of the harmonic measure $ω_x^Ω$ of a connected bounded domain $Ω$ with respect to a point $x\inΩ$. In particular, using a new notion of computable harmonic approximation, we show that for an arbitrary such $Ω$, computability of the harmonic measure $ω^Ω_x$ for a single point $x\inΩ$ implies ...
Ilia Binder +3 more
openaire +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
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
Frontiers in Environmental Science, 2022 The reform of water resource tax policies is an important measure in the process of China’s green economic transformation. Therefore, improving the accuracy of tax policy impact prediction is crucial for policymakers to make correct decisions. This study
Chunhua Xin, Fengqi Guo, Anqi Wang
doaj +1 more source