German mathematician who developed computable analysis — a rigorous treatment of computability for real numbers and continuous functions — and the Weihrauch reducibility hierarchy.
Computable Analysis: the standard rigorous treatment of computability for analysis — a function is computable if there is a Turing machine computing approximations to its values. Weihrauch degrees: a hierarchy of computational problems in analysis analogous to the polynomial hierarchy in complexity theory.
No recorded contemporaries.
Discussing
Ask anything about Klaus Weihrauch — their ideas, influences, contradictions, legacy.
Sign in to start a conversation.