Klaus Weihrauch

University of Hagen — Germany

Computer Science · Physical Sciences

26h-index3.8kcitations194works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computability, Logic, AI Algorithms(137), semigroups and automata theory(39), Cellular Automata and Applications(27), Advanced Topology and Set Theory(24), Mathematical Dynamics and Fractals(18)

Publications194 total

Intersection points of planar curves can be computed
Computability·2021Open Access
The Riesz Representation Operator on the Dual of <I>C</I>[0; 1] is Computable
TUGraz OPEN Library (Graz University of Technology)·2020· 2 citedOpen Access
Computable Separation in Topology, from <I>T</I><sub>0</sub> to <I>T</I><sub>2</sub>
TUGraz OPEN Library (Graz University of Technology)·2020Open Access
Computable Riesz Representation for Locally Compact Hausdorff Spaces
TUGraz OPEN Library (Graz University of Technology)·2020Open Access
Elementary Computable Topology
TUGraz OPEN Library (Graz University of Technology)·2020· 57 citedOpen Access
Topological Complexity of Blowup Problems
Zenodo (CERN European Organization for Nuclear Research)·2020· 6 citedOpen Access
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
TUGraz OPEN Library (Graz University of Technology)·2020· 34 citedOpen Access
Computable planar curves intersect in a computable point
Computability·2018· 3 cited
Reliable Computation and Complexity on the Reals (Dagstuhl Seminar 17481)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018Open Access
Computable planar paths intersect in a computable point
arXiv (Cornell University)·2017Open Access
Computability on measurable functions
Computability·2016· 3 cited
Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$
Logical Methods in Computer Science·2014· 7 citedOpen Access
Representations of measurable sets in computable measure theory
Logical Methods in Computer Science·2014· 6 citedOpen Access
Computable Analysis : An Introduction
2014· 773 citedOpen Access
Products of effective topological spaces and a uniformly computable Tychonoff Theorem
Logical Methods in Computer Science·2013· 10 citedOpen Access
Computably regular topological spaces
Logical Methods in Computer Science·2013· 10 citedOpen Access
The Riesz Representation Operator on the Dual of C[0; 1] is Computable
Zenodo (CERN European Organization for Nuclear Research)·2013· 2 citedOpen Access
Computable Separation in Topology, from T0 to T2
2012· 14 citedOpen Access
Computability of the Radon-Nikodym Derivative
Computability·2012· 22 citedOpen Access
Computability of the Radon-Nikodym derivative
arXiv (Cornell University)·2011· 4 citedOpen Access
page 1 of 10Next →

Frequent Co-authors

Christoph Kreitz(6), Ning Zhong(6), Peter Hertling(5), Xizhong Zheng(4), Tanja Grubba(4), Vasco Brattka(2), Mathieu Hoyrup(2), Cristóbal Rojas(2), Robert Rettinger(1), Ulrich Schreiber(1), Klaus Ambos‐Spies(1), Yongcheng Wu(1), N. R. Tavana(1), Jack H. Lutz(1), Matthias Schröder(1), Ker‐I Ko(1), Guido Schäfer(1), Cristian S. Calude(1), Helmut Jürgensen(1)