Weihrauch, Klaus

From MaRDI portal
Person:162062

Available identifiers

zbMath Open weihrauch.klausMaRDI QIDQ162062

List of research outcomes

PublicationDate of PublicationType
Intersection points of planar curves can be computed2022-05-16Paper
Computable planar curves intersect in a computable point2020-01-17Paper
https://portal.mardi4nfdi.de/entity/Q53775772019-05-27Paper
Computability on the probability measures on the Borel sets of the unit interval2018-07-04Paper
A simple and powerful approach for studying constructivity, computability, and complexity2017-11-17Paper
Computability on measurable functions2017-02-23Paper
Computability theory of generalized functions2015-11-12Paper
Representations of measurable sets in computable measure theory2014-09-05Paper
Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1$]2014-09-05Paper
Products of effective topological spaces and a uniformly computable Tychonoff Theorem2013-11-28Paper
Computably regular topological spaces2013-09-06Paper
Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I)2013-05-10Paper
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-10Paper
On Computable Metrization2013-05-10Paper
Complexity of Blowup Problems2013-05-03Paper
Computable Riesz Representation for Locally Compact Hausdorff Spaces2013-05-03Paper
Effectivity on Continuous Functions in Topological Spaces2013-05-03Paper
Connectivity Properties of Dimension Level Sets2013-05-03Paper
The Computational Complexity of Some Julia Sets2013-04-19Paper
The Solution Operator of the Korteweg-de Vries Equation is Computable2013-04-19Paper
Computability of the Radon-Nikodym Derivative2013-01-30Paper
https://portal.mardi4nfdi.de/entity/Q29173352012-09-28Paper
Computability of the Radon-Nikodym Derivative2011-09-09Paper
Turing machines on represented sets, a model of computation for Analysis2011-05-17Paper
https://portal.mardi4nfdi.de/entity/Q30752222011-02-10Paper
The computational complexity of some julia sets2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q36390662009-10-28Paper
https://portal.mardi4nfdi.de/entity/Q36390702009-10-28Paper
Absolutely non-computable predicates and functions in analysis2009-03-24Paper
Connectivity properties of dimension level sets2008-10-08Paper
https://portal.mardi4nfdi.de/entity/Q35184322008-08-08Paper
https://portal.mardi4nfdi.de/entity/Q35184342008-08-08Paper
https://portal.mardi4nfdi.de/entity/Q53849842008-04-29Paper
Absolutely Non-effective Predicates and Functions in Computable Analysis2007-11-13Paper
Computable metrization2007-09-17Paper
Computable Riesz representation for the dual of C [0; 1]2007-09-17Paper
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I2007-09-17Paper
Theory and Applications of Models of Computation2007-04-30Paper
Computing Schrödinger propagators on type-2 Turing machines2007-02-08Paper
A computable version of the Daniell-Stone theorem on integration and linear functionals2006-09-14Paper
An Algorithm for Computing Fundamental Solutions2006-06-01Paper
New Computational Paradigms2006-01-11Paper
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines2005-04-06Paper
https://portal.mardi4nfdi.de/entity/Q44363662003-12-04Paper
Random elements in effective topological spaces with measure.2003-08-19Paper
Randomness on full shift spaces2003-04-28Paper
Computational complexity on computable metric spaces2003-03-19Paper
IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?2002-10-22Paper
https://portal.mardi4nfdi.de/entity/Q45513962002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q45319982002-05-27Paper
https://portal.mardi4nfdi.de/entity/Q45319992002-05-27Paper
Weakly computable real numbers2001-05-29Paper
https://portal.mardi4nfdi.de/entity/Q27070712001-05-20Paper
https://portal.mardi4nfdi.de/entity/Q49418862001-02-22Paper
Approaches to Effective Semi‐Continuity of Real Functions2000-08-23Paper
Computability on continuous, lower semi-continuous and upper semi-continuous real functions2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q44856932000-06-18Paper
https://portal.mardi4nfdi.de/entity/Q49386542000-05-02Paper
https://portal.mardi4nfdi.de/entity/Q42181541999-09-09Paper
A refined model of computation for continuous problems1999-08-23Paper
Computability on subsets of Euclidean space. I: Closed and compact subsets1999-06-21Paper
Computability on the probability measures on the Borel sets of the unit interval1999-06-21Paper
Effectiveness of the global modulus of continuity on metric spaces1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42184201999-03-30Paper
https://portal.mardi4nfdi.de/entity/Q42190531999-02-14Paper
https://portal.mardi4nfdi.de/entity/Q43629691998-11-26Paper
https://portal.mardi4nfdi.de/entity/Q42175821998-11-11Paper
https://portal.mardi4nfdi.de/entity/Q43645861998-03-23Paper
https://portal.mardi4nfdi.de/entity/Q43735601998-01-21Paper
https://portal.mardi4nfdi.de/entity/Q43710211998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q48401881995-07-23Paper
Computability on computable metric spaces1994-03-20Paper
https://portal.mardi4nfdi.de/entity/Q39982371993-01-23Paper
On the complexity of online computations of real functions1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39748891992-06-26Paper
Type 2 computational complexity of functions on Cantor's space1991-01-01Paper
Compactness in constructive analysis revisited1987-01-01Paper
Representations of the real numbers and of the open subsets of the set of real numbers1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37515531987-01-01Paper
Type 2 recursion theory1985-01-01Paper
Theory of representations1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32221781984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37224981984-01-01Paper
Admissible representations of effective cpo's1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39661201982-01-01Paper
Embedding metric spaces into CPO's1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39149741981-01-01Paper
Is Binary Notation Optimal?1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39455861981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38906791980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39313761980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38841061979-01-01Paper
Data representation and computational complexity1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38613681977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41456951977-01-01Paper
The computational complexity of program schemata1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41057901976-01-01Paper
Program schemata with polynomial bounded counters1975-01-01Paper
On primitive recursive wordfunctions1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40445531974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47768321974-01-01Paper
Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41285461973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47672101973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47699691973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Weihrauch, Klaus