Publication | Date of Publication | Type |
---|
Intersection points of planar curves can be computed | 2022-05-16 | Paper |
Computable planar curves intersect in a computable point | 2020-01-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q5377577 | 2019-05-27 | Paper |
Computability on the probability measures on the Borel sets of the unit interval | 2018-07-04 | Paper |
A simple and powerful approach for studying constructivity, computability, and complexity | 2017-11-17 | Paper |
Computability on measurable functions | 2017-02-23 | Paper |
Computability theory of generalized functions | 2015-11-12 | Paper |
Representations of measurable sets in computable measure theory | 2014-09-05 | Paper |
Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1$] | 2014-09-05 | Paper |
Products of effective topological spaces and a uniformly computable Tychonoff Theorem | 2013-11-28 | Paper |
Computably regular topological spaces | 2013-09-06 | Paper |
Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) | 2013-05-10 | Paper |
Computable Riesz Representation for the Dual of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>C</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false"></mml:mo></mml:math>] | 2013-05-10 | Paper |
On Computable Metrization | 2013-05-10 | Paper |
Complexity of Blowup Problems | 2013-05-03 | Paper |
Computable Riesz Representation for Locally Compact Hausdorff Spaces | 2013-05-03 | Paper |
Effectivity on Continuous Functions in Topological Spaces | 2013-05-03 | Paper |
Connectivity Properties of Dimension Level Sets | 2013-05-03 | Paper |
The Computational Complexity of Some Julia Sets | 2013-04-19 | Paper |
The Solution Operator of the Korteweg-de Vries Equation is Computable | 2013-04-19 | Paper |
Computability of the Radon-Nikodym Derivative | 2013-01-30 | Paper |
Computable Separation in Topology, from T_0 to T_3. | 2012-09-28 | Paper |
Computability of the Radon-Nikodym Derivative | 2011-09-09 | Paper |
Turing machines on represented sets, a model of computation for Analysis | 2011-05-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q3075222 | 2011-02-10 | Paper |
The computational complexity of some julia sets | 2010-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3639066 | 2009-10-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3639070 | 2009-10-28 | Paper |
Absolutely non-computable predicates and functions in analysis | 2009-03-24 | Paper |
Connectivity properties of dimension level sets | 2008-10-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q3518432 | 2008-08-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q3518434 | 2008-08-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q5384984 | 2008-04-29 | Paper |
Absolutely Non-effective Predicates and Functions in Computable Analysis | 2007-11-13 | Paper |
Computable metrization | 2007-09-17 | Paper |
Computable Riesz representation for the dual of C [0; 1] | 2007-09-17 | Paper |
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I | 2007-09-17 | Paper |
Theory and Applications of Models of Computation | 2007-04-30 | Paper |
Computing Schrödinger propagators on type-2 Turing machines | 2007-02-08 | Paper |
A computable version of the Daniell-Stone theorem on integration and linear functionals | 2006-09-14 | Paper |
An Algorithm for Computing Fundamental Solutions | 2006-06-01 | Paper |
New Computational Paradigms | 2006-01-11 | Paper |
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines | 2005-04-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4436366 | 2003-12-04 | Paper |
Random elements in effective topological spaces with measure. | 2003-08-19 | Paper |
Randomness on full shift spaces | 2003-04-28 | Paper |
Computational complexity on computable metric spaces | 2003-03-19 | Paper |
IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE? | 2002-10-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4551396 | 2002-09-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4531998 | 2002-05-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4531999 | 2002-05-27 | Paper |
Weakly computable real numbers | 2001-05-29 | Paper |
The Arithmetical Hierarchy of Real Numbers | 2001-05-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4941886 | 2001-02-22 | Paper |
Approaches to Effective Semi‐Continuity of Real Functions | 2000-08-23 | Paper |
Computability on continuous, lower semi-continuous and upper semi-continuous real functions | 2000-08-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4485693 | 2000-06-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4938654 | 2000-05-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4218154 | 1999-09-09 | Paper |
A refined model of computation for continuous problems | 1999-08-23 | Paper |
Computability on subsets of Euclidean space. I: Closed and compact subsets | 1999-06-21 | Paper |
Computability on the probability measures on the Borel sets of the unit interval | 1999-06-21 | Paper |
Effectiveness of the global modulus of continuity on metric spaces | 1999-06-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4218420 | 1999-03-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4219053 | 1999-02-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4362969 | 1998-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4217582 | 1998-11-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4364586 | 1998-03-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4373560 | 1998-01-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4371021 | 1998-01-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4840188 | 1995-07-23 | Paper |
Computability on computable metric spaces | 1994-03-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q3998237 | 1993-01-23 | Paper |
On the complexity of online computations of real functions | 1992-06-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3974889 | 1992-06-26 | Paper |
Type 2 computational complexity of functions on Cantor's space | 1991-01-01 | Paper |
Compactness in constructive analysis revisited | 1987-01-01 | Paper |
Representations of the real numbers and of the open subsets of the set of real numbers | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3751553 | 1987-01-01 | Paper |
Type 2 recursion theory | 1985-01-01 | Paper |
Theory of representations | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3222178 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3722498 | 1984-01-01 | Paper |
Admissible representations of effective cpo's | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3966120 | 1982-01-01 | Paper |
Embedding metric spaces into CPO's | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3914974 | 1981-01-01 | Paper |
Is Binary Notation Optimal? | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3945586 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3890679 | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3931376 | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3884106 | 1979-01-01 | Paper |
Data representation and computational complexity | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3861368 | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4145695 | 1977-01-01 | Paper |
The computational complexity of program schemata | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4105790 | 1976-01-01 | Paper |
Program schemata with polynomial bounded counters | 1975-01-01 | Paper |
On primitive recursive wordfunctions | 1975-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4044553 | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4776832 | 1974-01-01 | Paper |
Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4128546 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4767210 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4769969 | 1973-01-01 | Paper |