Searching for authors named "Peter Hertling" – sorted by Relevance.
-
Computable Real Functions: Type 1 Computability Versus Type 2 Computability
- Computable Real Functions: Type 1 Computability Versus Type 2 Computability Peter Hertling
- Add To MetaCart
-
The Real Number Structure is Effectively Categorical
- CDMTCS Research Report Series The Real Number Structure is E#ectively Categorical Peter Hertling
- Add To MetaCart
-
Is the Mandelbrot set computable?
- IS THE MANDELBROT SET COMPUTABLE? PETER HERTLING Abstract. We discuss the question whether
- Cited by 5 (0 self) – Add To MetaCart
-
Surjective functions on computably growing Cantor sets
- Cantor Sets 1 Peter Hertling (Department of Computer Science, The University of Auckland, Private Bag
- Cited by 4 (0 self) – Add To MetaCart
-
Embedding Cellular Automata into Reversible Ones
- CDMTCS Research Report Series Embedding Cellular Automata into Reversible Ones Peter Hertling
- Cited by 1 (0 self) – Add To MetaCart
-
A Lower Bound for Range Enclosure in Interval Arithmetic
- CDMTCS Research Report Series A Lower Bound for Range Enclosure in Interval Arithmetic Peter
- Cited by 2 (0 self) – Add To MetaCart
-
The Effective Riemann Mapping Theorem
- CDMTCS Research Report Series The E#ective Riemann Mapping Theorem Peter Hertling Department
- Cited by 6 (1 self) – Add To MetaCart
-
Titchener: Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders
- \Lambda Ulrich G"unther Peter Hertling Radu Nicolescu Mark Titchener June 24, 1997 Abstract T
- Cited by 8 (1 self) – Add To MetaCart
-
Invariance Properties of Random Sequences
- CDMTCS Research Report Series Invariance properties of random sequences Peter Hertling and Yongee
- Cited by 1 (1 self) – Add To MetaCart
-
Computable Approximations of Reals: An Information-Theoretic Analysis
- -Theoretic Analysis Cristian S. Calude Peter H. Hertling Department of Computer Science University of Auckland
- Cited by 10 (3 self) – Add To MetaCart

