Peter Hertling

Universität der Bundeswehr München — Germany

Computer Science · Physical Sciences

19h-index1.1kcitations86works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

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

Research Topics

Computability, Logic, AI Algorithms(59), semigroups and automata theory(21), Advanced Topology and Set Theory(16), Benford’s Law and Fraud Detection(14), Advanced Algebra and Logic(12)

Publications86 total

Binary Expansions of Regular Reals and Reordered Computable Numbers
Lecture notes in computer science·2025
REGAININGLY APPROXIMABLE NUMBERS AND SETS
Journal of Symbolic Logic·2024· 1 citedOpen Access
Nearly computable real numbers
Computability·2023· 1 citedOpen Access
Nearly Computable Real Numbers
arXiv (Cornell University)·2023Open Access
Regainingly approximable numbers and sets
arXiv (Cornell University)·2023Open Access
Remarks on the effective Jordan decomposition
Theoretical Computer Science·2022
Topological properties of the binary supremum function
Semigroup Forum·2022· 3 citedOpen Access
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces
ACM Transactions on Computational Logic·2021· 1 cited
Handbook of Computability and Complexity in Analysis
Theory and applications of computability·2021· 36 cited
Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations
Computability·2020· 5 cited
Invariance Properties of Random Sequences
Zenodo (CERN European Organization for Nuclear Research)·2020· 8 citedOpen Access
Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders
TUGraz OPEN Library (Graz University of Technology)·2020· 5 citedOpen Access
Surjective Functions on Computably Growing Cantor Sets
2020· 8 citedOpen Access
Nonrandom Sequences between Random Sequences
2020Open Access
Simply Normal Numbers to Different Bases
2020· 8 citedOpen Access
Disjunctive Omega-Words and Real Numbers
TUGraz OPEN Library (Graz University of Technology)·2020· 15 citedOpen Access
On the Computational Complexity of the Range Computation Problem
Studies in computational intelligence·2020· 1 cited
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of\n Subset Spaces, Part 1: ESPACE-Algorithms
arXiv (Cornell University)·2019Open Access
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness
arXiv (Cornell University)·2019Open Access
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms
arXiv (Cornell University)·2019Open Access
page 1 of 5Next →

Frequent Co-authors

Vasco Brattka(9), Cristian S. Calude(8), Klaus Weihrauch(5), Bakhadyr Khoussainov(4), Yongge Wang(3), Jens Blanck(2), Karl Svozil(2), Ulrich L. Günther(2), Radu Nicolescu(2), M.R. Titchener(2), Christoph Spandl(2), Cca(1), Richard J. Coles(1), Helmut Jürgensen(1), Ker‐I Ko(1), Hideki Tsuiki(1), Volker Bosserhoff(1), Victor Selivanov(1)