Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Wiesnet, Franziskus"'
In this dissertation we discuss several forms of proof interpretation based on examples in algebra and analysis. Our main goal is the construction of algorithms or functions out of proofs - constructive proofs and classical proofs. At the beginning o
Externí odkaz:
http://hdl.handle.net/11572/313875
Autor:
Powell, Thomas, Wiesnet, Franziskus
We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More specifically, we
Externí odkaz:
http://arxiv.org/abs/2104.14495
Autor:
Wiesnet, Franziskus, Köpp, Nils
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (August 19, 2022) lmcs:7310
We extract verified algorithms for exact real number computation from constructive proofs. To this end we use a coinductive representation of reals as streams of binary signed digits. The main objective of this paper is the formalisation of a constru
Externí odkaz:
http://arxiv.org/abs/2103.15702
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 2 (April 20, 2021) lmcs:5419
Continuing earlier work of the first author with U. Berger, K. Miyamoto and H. Tsuiki, it is shown how a division algorithm for real numbers given as a stream of signed digits can be extracted from an appropriate formal proof. The property of being a
Externí odkaz:
http://arxiv.org/abs/1904.12763
The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a constructiv
Externí odkaz:
http://arxiv.org/abs/1903.03070
Autor:
Wiesnet, Franziskus
We work with the signed digit representation of abstract real numbers, which roughly is the binary representation enriched by the additional digit -1. The main objective of this paper is an algorithm which takes a sequence of signed digit representat
Externí odkaz:
http://arxiv.org/abs/1807.10492
Publikováno v:
In Information and Computation September 2022 287
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Continuing earlier work of the first author with U. Berger, K. Miyamoto and H. Tsuiki, it is shown how a division algorithm for real numbers given as a stream of signed digits can be extracted from an appropriate formal proof. The property of being a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=sygma_______::6b598b9810a170785ab8e60ed36fc037
https://doi.org/10.23638/lmcs-17(2:7)2021
https://doi.org/10.23638/lmcs-17(2:7)2021
Autor:
Wiesnet, Franziskus
In this dissertation we discuss several forms of proof interpretation based on examples in algebra and analysis. Our main goal is the construction of algorithms or functions out of proofs - constructive proofs and classical proofs. At the beginning o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8dc3e5301bd58a0f4ddbbdff49b7098b