Zobrazeno 1 - 10
of 3 349
pro vyhledávání: '"computable analysis"'
Autor:
Xie, Jingnan1 (AUTHOR) jingnan.xie@millersville.edu, Hunt III, Harry B.2 (AUTHOR) huntharryiii@gmail.com, Stearns, Richard E.2 (AUTHOR) thestearns2@gmail.com
Publikováno v:
Mathematics (2227-7390). Oct2024, Vol. 12 Issue 20, p3248. 12p.
Publikováno v:
Mathematics, Vol 12, Iss 20, p 3248 (2024)
This paper investigates the complexity of real functions through proof techniques inspired by formal language theory. Productiveness, which is a stronger form of non-recursive enumerability, is employed to analyze the complexity of various problems r
Externí odkaz:
https://doaj.org/article/1cd0ed4f4d90425fb2a6a2b963f643c5
Autor:
Brattka, Vasco
Publikováno v:
in: L\"owe, Benedikt and Sarikaya, Deniz (eds.), 60 Jahre DVMLG, vol. 48 of Tributes, College Publications, London, 2022, pages 13-44
Weihrauch complexity is now an established and active part of mathematical logic. It can be seen as a computability-theoretic approach to classifying the uniform computational content of mathematical problems. This theory has become an important inte
Externí odkaz:
http://arxiv.org/abs/2203.06166
Autor:
Rauzy, Emmanuel
We investigate decision problems for finitely generated groups described by word problem algorithms. This is equivalent to studying groups described by computable labelled Cayley graphs. We relate these problems to the study of computable analysis on
Externí odkaz:
http://arxiv.org/abs/2111.01179
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 2 (May 12, 2021) lmcs:5418
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
Externí odkaz:
http://arxiv.org/abs/1904.13203
Autor:
Klaus Weihrauch
Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set dec
Publikováno v:
in: Brattka, V. and Hertling, P. (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 367-417
We provide a self-contained introduction into Weihrauch complexity and its applications to computable analysis. This includes a survey on some classification results and a discussion of the relation to other approaches.
Comment: 50 pages plus 11
Comment: 50 pages plus 11
Externí odkaz:
http://arxiv.org/abs/1707.03202