Results 11 to 20 of about 120,189 (290)
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
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
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
Complexity theory for spaces of integrable functions [PDF]
Logical Methods in Computer Science, 2017 This paper investigates second-order representations in the sense of Kawamura and Cook for spaces of integrable functions that regularly show up in analysis. It builds upon prior work about the space of continuous functions on the unit interval: Kawamura
Florian Steinberg
doaj +1 more source
Computational Analysis of Metasurfaces [PDF]
IEEE Journal on Multiscale and Multiphysics Computational Techniques, 2018 Metasurfaces represent one of the most vibrant fields of modern science and technology. A metasurface is a complex electromagnetic structure, that is typically deeply subwavelength in thickness, electrically large in transverse size and composed of subwavelength scattering particles with extremely small features; it may generally be bianisotropic ...
Yousef Vahabzadeh +3 more
openaire +3 more sources
Computational Analysis of Molnupiravir [PDF]
International Journal of Molecular Sciences, 2022 In this work, we report in-depth computational studies of three plausible tautomeric forms, generated through the migration of two acidic protons of the N4-hydroxylcytosine fragment, of molnupiravir, which is emerging as an efficient drug to treat COVID-19. The DFT calculations were performed to verify the structure of these tautomers, as well as their
Artem Sharov +4 more
openaire +3 more sources
Effecs of Bolsa Família on rural welfare: a computable equilibrium analysis
Economia & Região, 2023 This paper analyzes the effects of the Bolsa Família Program on the economic well-being of rural families in the Brazilian macrorregions, contributing to the debate on income transfer programs.
Rayan Wolf +4 more
doaj +1 more source
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]
, 2016 We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier +2 more
core +3 more sources
On the information carried by programs about the objects they compute [PDF]
, 2014 In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an infinite tape. What
Hoyrup, Mathieu, Rojas, Cristobal
core +7 more sources