Theoretical Computer Science
Manuel Eberl's user avatar
Manuel Eberl's user avatar
Manuel Eberl's user avatar
Manuel Eberl
  • Member for 10 years, 2 months
  • Last seen more than a month ago
Profile Activity
Stats
273
reputation
6k
reached
1
answer
2
questions
Communities
View all
About

Computer Science postdoc at TU München, Esperantist, addicted to formal proofs/interactive theorem proving and Earl Grey. Some knowledge of Isabelle/HOL, Java, C/C++, Haskell, Standard ML, theoretical computer science, finite automata, cryptography, and basic mathematics (i.e. logic, algebra, geometry, number theory, analysis).

Badges
This user doesn’t have any gold badges yet.
1
silver badge
6
bronze badges
Top tags
View all tags
0
Score
3
Posts
100
Posts %
0
Score
2
Posts
67
Posts %
0
Score
1
Posts
33
Posts %
0
Score
1
Posts
33
Posts %
0
Score
1
Posts
33
Posts %
0
Score
1
Posts
33
Posts %
Top posts
answer
9
Hard-looking algorithmic problems made easy by theorems
Feb 17, 2014
question
7
Isomorphism of ‘ordered’ DAGs / acyclic semiautomata
Sep 12, 2020
question
7
Baker–Gill–Solovay Theorem: why $2^n/10$ steps?
May 16, 2023
Top network posts
View all network posts
142
Proofs shown to be wrong after formalization with proof assistant
35
Looking for some interesting complex integration contours
14
Isabelle/HOL foundations
11
Equivalence classes and union/find in a functional language
11
Nenegata versio de “ĉu ne?”