Stack Exchange

Denis

ENS Lyon, Lyon, France

http://perso.ens-lyon.fr/denis.kuperberg

top accounts reputation activity bookmarks subscriptions
Top Questions
Top Answers
109
Interview riddle
math.stackexchange.com

44
Real computers have only a finite number of states, so what is the relevance of Turing machines to real computers?
cstheory.stackexchange.com

35
Are there any examples of non-computable real numbers?
math.stackexchange.com

32
What is the smallest Turing machine where it is unknown if it halts or not?
cstheory.stackexchange.com

29
Most important new papers in computational complexity
cstheory.stackexchange.com

26
What is a limit point
math.stackexchange.com

25
rescue operation - where is your partner?
puzzling.stackexchange.com

24
Essays and thoughts on mathematics
mathoverflow.net

17
Linear span of the empty set
math.stackexchange.com

15
Parameterized complexity of inclusion of regular languages
cstheory.stackexchange.com

14
What notable automaton models have polynomially-decidable containment?
cstheory.stackexchange.com

13
Are all mathematical statements true or false?
math.stackexchange.com

13
Counterintuitive results for undergraduates
cstheory.stackexchange.com

13
A simple decision problem whose decidability is not known
cstheory.stackexchange.com

12
On the realisation of monoids as syntactic monoids of languages
cstheory.stackexchange.com

12
Caterpillar decomposition of trees
cstheory.stackexchange.com

11
The paradox with the first uncountable ordinal
mathoverflow.net

11
Are Boolean circuits 'universal'
cstheory.stackexchange.com

10
Deterministic Büchi + its complement covers LTL?
cstheory.stackexchange.com

9
Useless math that became useful
mathoverflow.net

9
A quine in pure lambda calculus
cs.stackexchange.com

8
Major unsolved problems in theoretical computer science?
cstheory.stackexchange.com

8
Is the game 2048 always solveable?
math.stackexchange.com

8
What exactly are equivalence classes
math.stackexchange.com

8
Constraints on sliding windows
cstheory.stackexchange.com

8
Complexity of Unknotting problems
cstheory.stackexchange.com

7
Have I negated the statement “for every prime number $p$, $p+7$ is composite” correctly?
math.stackexchange.com

7
decidability of fullness of intersection of a CSL with a regular language
cstheory.stackexchange.com

7
Why can a $2k$-regular graph be $k$-factored?
math.stackexchange.com

7
Context-free language and regular expressions
cs.stackexchange.com

1 2 3