Peter Hertling

According to our database, Peter Hertling authored at least 56 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Remarks on the effective Jordan decomposition.

Peter Hertling

Theor. Comput. Sci., 2023

Nearly Computable Real Numbers.

Peter Hertling, Philip Janicki

CoRR, 2023

2021

EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces.

Peter Hertling, Gisela Krommes

ACM Trans. Comput. Log., 2021

2020

Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations.

Peter Hertling

Comput., 2020

2019

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness.

Peter Hertling, Gisela Krommes

CoRR, 2019

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms.

Peter Hertling, Gisela Krommes

CoRR, 2019

2017

Clarke's generalized gradient and Edalat's L-derivative.

Peter Hertling

J. Log. Anal., 2017

2016

Two Counterexamples Concerning the Scott Topology on a Partial Order.

Peter Hertling

CoRR, 2016

2015

Effective subsets under homeomorphisms of Rⁿ.

Volker Bosserhoff, Peter Hertling

Inf. Comput., 2015

2014

Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time.

Peter Hertling, Christoph Spandl

Log. Methods Comput. Sci., 2014

Complexity issues for Preorders on finite labeled forests.

Peter Hertling, Victor L. Selivanov

Proceedings of the Logic, Computation, Hierarchies, 2014

2011

Complexity Issues for Preorders on Finite Labeled Forests.

Peter Hertling, Victor L. Selivanov

Proceedings of the Models of Computation in Context, 2011

2010

Computability and Complexity in Analysis.

Andrej Bauer, Peter Hertling, Ker-I Ko

J. Univers. Comput. Sci., 2010

2009

CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.

Andrej Bauer, Peter Hertling, Ker-I Ko

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.

Andrej Bauer, Peter Hertling, Ker-I Ko

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

Computability Theoretic Properties of the Entropy of Gap Shifts.

Peter Hertling, Christoph Spandl

Fundam. Informaticae, 2008

Shifts with Decidable Language and Non-Computable Entropy.

Peter Hertling, Christoph Spandl

Discret. Math. Theor. Comput. Sci., 2008

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.

Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner

Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations.

Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner

Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

2006

A sequentially computable function that is not effectively continuous at any point.

Peter Hertling

J. Complex., 2006

Computability and complexity in analysis.

Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki

J. Complex., 2006

06021 Abstracts Collection -- Reliable Implementation of Real Number Algorithms: Theory and Practice.

Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol

Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

06021 Summary -- Reliable Implementation of Real Number Algorithms: Theory and Practice.

Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol

Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

2005

Is the Mandelbrot set computable?

Peter Hertling

Math. Log. Q., 2005

Nonrandom Sequences between Random Sequences.

Peter Hertling

J. Univers. Comput. Sci., 2005

A Banach-Mazur computable but not Markov computable function on the computable real numbers.

Peter Hertling

Ann. Pure Appl. Log., 2005

Computable Analysis via Representations.

Peter Hertling

Proceedings of the CCA 2005, 2005

A Sequentially Computable Function that is not Effectively Continous at any Point.

Peter Hertling

Proceedings of the CCA 2005, 2005

2004

Preface: MLQ - Math. Log. Quart. 4-5/2004.

Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong

Math. Log. Q., 2004

2003

Random elements in effective topological spaces with measure.

Peter Hertling, Klaus Weihrauch

Inf. Comput., 2003

2002

A lower bound for range enclosure in interval arithmetic.

Peter Hertling

Theor. Comput. Sci., 2002

Topological properties of real number representations.

Vasco Brattka, Peter Hertling

Theor. Comput. Sci., 2002

Preface: MLQ - Math. Log. Quart. Supplement 1/2002.

Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong

Math. Log. Q., 2002

Simply Normal Numbers to Different Bases.

Peter Hertling

J. Univers. Comput. Sci., 2002

Topological Complexity of Zero Finding with Algebraic Operations.

Peter Hertling

J. Complex., 2002

A Comparison of Certain Representations of Regularly Closed Sets.

Peter Hertling

Proceedings of the Computability and Complexity in Analysis, 2002

2001

Recursively enumerable reals and Chaitin Omega numbers.

Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang

Theor. Comput. Sci., 2001

A Limitation for Underestimation Via Twin Arithmetic.

Peter Hertling

Reliab. Comput., 2001

Nonlinear Lebesgue and Ito^ Integration Problems of High Complexity.

Peter Hertling

J. Complex., 2001

2000

Banach-Mazur Computable Functions on Metric Spaces.

Peter Hertling

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

The Effective Riemann Mapping Theorem.

Peter Hertling

Theor. Comput. Sci., 1999

A Real Number Structure that is Effectively Categorical.

Peter Hertling

Math. Log. Q., 1999

1998

Feasible Real Random Access Machines.

Vasco Brattka, Peter Hertling

J. Complex., 1998

Computable Approximations of Reals: An Information-Theoretic Analysis.

Cristian Calude, Peter Hertling

Fundam. Informaticae, 1998

Randomness Spaces.

Peter Hertling, Klaus Weihrauch

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Invariance Properties of Random Sequences.

Peter Hertling, Yongge Wang

J. Univers. Comput. Sci., 1997

Surjective Functions on Computably Growing Cantor Sets.

Peter Hertling

J. Univers. Comput. Sci., 1997

Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders.

Ulrich Günther, Peter Hertling, Radu Nicolescu, Mark R. Titchener

J. Univers. Comput. Sci., 1997

Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?

Cristian Calude, Peter Hertling, Bakhadyr Khoussainov

Bull. EATCS, 1997

1996

Unstetigkeitsgrade von Funktionen in der effektiven Analysis.

Peter Hertling

PhD thesis, 1996

Task curve planning for painting robots. I. Process modeling and calibration.

Peter Hertling, Lars Hog, Rune Larsen, John W. Perram, Henrik Gordon Petersen

IEEE Trans. Robotics Autom., 1996

Disjunctive omega-Words and Real Numbers.

Peter Hertling

J. Univers. Comput. Sci., 1996

Topological Complexity with Continuous Operations.

Peter Hertling

J. Complex., 1996

Effectivity and Effective Continuity of Functions between Computable Metric Spaces.

Peter Hertling

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

Computable Real Functions: Type 1 Computability Versus Type 2 Computability.

Peter Hertling

Proceedings of the Second Workshop on Computability and Complexity in Analysis, 1996

1994

Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms.

Peter Hertling, Klaus Weihrauch

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994