Klaus Weihrauch

Comput., 2022

2019

Computable planar curves intersect in a computable point.

[BibT_eX]

[DOI]

Comput., 2019

2017

Computability on measurable functions.

[BibT_eX]

[DOI]

Comput., 2017

2014

Representations of measurable sets in computable measure theory.

[BibT_eX]

[DOI]

Nazanin Roshandel Tavana

Log. Methods Comput. Sci., 2014

Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$.

[BibT_eX]

[DOI]

Tahereh Jafarikhah

Log. Methods Comput. Sci., 2014

2013

Computably regular topological spaces.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

The Riesz Representation Operator on the Dual of C[0; 1] is Computable.

[BibT_eX]

[DOI]

Tahereh Jafarikhah

J. Univers. Comput. Sci., 2013

Products of effective topological spaces and a uniformly computable Tychonoff Theorem.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

2012

Computability of the Radon-Nikodym Derivative.

[BibT_eX]

[DOI]

Mathieu Hoyrup

Cristobal Rojas

Comput., 2012

2011

Turing machines on represented sets, a model of computation for Analysis

[BibT_eX]

[DOI]

Nazanin Tavana

Log. Methods Comput. Sci., 2011

2010

Computable Separation in Topology, from T0 to T2.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2010

2009

Absolutely non-computable predicates and functions in analysis.

[BibT_eX]

[DOI]

Yongcheng Wu

Decheng Ding

Math. Struct. Comput. Sci., 2009

Elementary Computable Topology.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2009

Topological Complexity of Blowup Problems.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2009

Computable Separation in Topology, from T_0 to T_3.

[BibT_eX]

[DOI]

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

2008

The Computable Multi-Functions on Multi-represented Sets are Closed under Programming.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2008

Computable Riesz Representation for Locally Compact Hausdorff Spaces.

[BibT_eX]

[DOI]

Hong Lu

J. Univers. Comput. Sci., 2008

Complexity of Blowup Problems: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

Computable Riesz representation for the dual of C [0; 1].

[BibT_eX]

[DOI]

Hong Lu

Math. Log. Q., 2007

Editorial: Math. Log. Quart. 4-5/2007.

[BibT_eX]

[DOI]

Ker-I Ko

Math. Log. Q., 2007

Computable metrization.

[BibT_eX]

[DOI]

Matthias Schröder

Math. Log. Q., 2007

Connectivity Properties of Dimension Level Sets.

[BibT_eX]

[DOI]

Jack H. Lutz

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Effectivity on Continuous Functions in Topological Spaces.

[BibT_eX]

[DOI]

Yatao Xu

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Preface.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Absolutely Non-effective Predicates and Functions in Computable Analysis.

[BibT_eX]

[DOI]

Decheng Ding

Yongcheng Wu

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

A computable version of the Daniell-Stone theorem on integration and linear functionals.

[BibT_eX]

[DOI]

Yongcheng Wu

Theor. Comput. Sci., 2006

An Algorithm for Computing Fundamental Solutions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Computing Schrödinger propagators on Type-2 Turing machines.

[BibT_eX]

[DOI]

J. Complex., 2006

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I).

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Computable Riesz Representation for the Dual of C.

[BibT_eX]

[DOI]

Hong Lu

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

On Computable Metrization.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Preface.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable?

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Computable Version of Dini's Theorem for Topological Spaces.

[BibT_eX]

[DOI]

Proceedings of the Computer and Information Sciences, 2005

Computable Analysis.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming.

[BibT_eX]

Proceedings of the CCA 2005, 2005

2004

Preface.

[BibT_eX]

[DOI]

Ludwig Staiger

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

2003

Computatbility theory of generalized functions.

[BibT_eX]

[DOI]

J. ACM, 2003

Random elements in effective topological spaces with measure.

[BibT_eX]

[DOI]

Peter Hertling

Inf. Comput., 2003

2002

Foreword.

[BibT_eX]

[DOI]

Ker-I Ko

Anil Nerode

Theor. Comput. Sci., 2002

The Solution Operator of the Korteweg-de Vries Equation is Computable.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

The Computational Complexity of Some Julia Sets.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

Preface.

[BibT_eX]

[DOI]

Matthias Schröder

Proceedings of the Computability and Complexity in Analysis, 2002

Computational Complexity on Computable Metric Spaces

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2002

2001

The Arithmetical Hierarchy of Real Numbers.

[BibT_eX]

[DOI]

Math. Log. Q., 2001

Turing Computability of a Nonlinear Schrödinger Propagator.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Computable Analysis - An Introduction

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-56999-9, 2000

Computability on continuous, lower semi-continuous and upper semi-continuous real functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Weakly Computable Real Numbers.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

J. Complex., 2000

Is the Linear Schrödinger Propagator Turing Computable?

[BibT_eX]

[DOI]

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

On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.

[BibT_eX]

[DOI]

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

1999

Effectiveness of the Global Modulus of Continuity on Metric Spaces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Computability on the Probability Measureson the Borel Sets of the Unit Interval.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Computability on Subsets of Euclidean Space I: Closed and Compact Subsets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Approaches to Effective Semi-Continuity of Real Functions.

[BibT_eX]

[DOI]

Math. Log. Q., 1999

The Wave Propagator Is Turing Computable.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

A Refined Model of Computation for Continuous Problems.

[BibT_eX]

[DOI]

J. Complex., 1998

A Finite Hierarchy of the Recursively Enumerable Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Recursive and Recursively Enumerable Closed Subsets of Euclidean Space.

[BibT_eX]

Proceedings of the International Colloquium Universal Machines and Computations, 1998

Randomness Spaces.

[BibT_eX]

[DOI]

Peter Hertling

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

1997

Computability on the Probability Measures on the Borel Sets of the Unit Interval.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries.

[BibT_eX]

[DOI]

Ker-I Ko

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995

A Foundation of Computable Analysis.

[BibT_eX]

Bull. EATCS, 1995

1994

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

[BibT_eX]

Peter Hertling

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

1993

Computability on Computable Metric Spaces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

1991

Type 2 Computational Complexity of Functions on Cantor's Space.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On the complexity of online computations of real functions.

[BibT_eX]

[DOI]

J. Complex., 1991

A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Constructivity in Computer Science, 1991

Logik für Informatiker - eine Einführung.

[BibT_eX]

Bernhard Heinemann

Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02248-0, 1991

1989

Constructivity, Computability, and Computational Complexity in Analysis.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1987

Computability

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 9, Springer, ISBN: 0-387-13721-1, 1987

Representations of the real numbers and of the open subsets of the set of real numbers.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1987

Compactness in constructive analysis revisited.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1987

1985

Type 2 Recursion Theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Theory of Representations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1983

Admissible Representations of Effective CPO's.

[BibT_eX]

[DOI]

Gisela Schäfer

Theor. Comput. Sci., 1983

Complexity theory on real numbers and functions.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1983

1981

Embedding Metric Spaces Into CPO's.

[BibT_eX]

[DOI]

Ulrich Schreiber

Theor. Comput. Sci., 1981

Recursion and Complexity Theory on CPO-S.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

1980

Natural Numberings and Generalized Computability.

[BibT_eX]

Angelika Reiser

J. Inf. Process. Cybern., 1980

1978

Data Representation and Computational Complexity.

[BibT_eX]

[DOI]

Rutger Verbeek

Theor. Comput. Sci., 1978

1977

A Generalized Computability Thesis (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

A Genralized Computability Thesis.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1976

The Computational Complexity of Program Schemata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

The Influence of the Data Presentation on the Computational POwer of Machines.

[BibT_eX]

[DOI]

Rutger Verbeek

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975

Program Schemata with Polynomial Bounded Counters.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1975

On primitive recursive wordfunctions.

[BibT_eX]

[DOI]

Friedrich W. von Henke

G. Rose

Klaus Indermark

Computing, 1975

1974

The Compuational Complexity of Program Schemata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973

A characterization of the classes L1 and R1 of primitive recursive wordfunctions.

[BibT_eX]

[DOI]

G. Rose

Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

Einführung in die Codierungstheorie I.

[BibT_eX]

Tiko Kameda

Skripten zur Informatik 7, BI-Wissenschaftsverlag, ISBN: 978-3-411-00783-7, 1973

1972

Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata.

[BibT_eX]

Friedrich W. von Henke

Klaus Indermark

Proceedings of the Automata, 1972

Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen.

[BibT_eX]

[DOI]

Friedrich W. von Henke