Hannes Diener
CV
Research
Talks
Publications
Research
Interests
Analysis:
computable analysis, Bishop-style constructive mathematics, algorithmic aspects of continuity.
Foundations of mathematics and computer science:
exact real number computations, algorithmic proofs, computability theory, algorithmic foundations of topology (especially aspects of compactness).
Logic:
intuitionistic logic, constructive reverse mathematics, non-classical axioms, program extraction from constructive proofs.
Blog Posts
a funny function
05 September 2018
completion of metric spaces
18 January 2016
computing with infinite objects
25 August 2015