MathOverflow
Andrea Asperti's user avatar
Andrea Asperti's user avatar
Andrea Asperti's user avatar
Andrea Asperti
  • Member for 7 years, 2 months
  • Last seen more than a week ago
Profile Activity
Stats
171
reputation
5k
reached
2
answers
0
questions
Communities
View all
About

I am Professor of Computer Science at the University of Bologna

Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
4
bronze badges
Top tags
View all tags
7
Score
2
Posts
100
Posts %
6
Score
1
Posts
50
Posts %
6
Score
1
Posts
50
Posts %
6
Score
1
Posts
50
Posts %
1
Score
1
Posts
50
Posts %
1
Score
1
Posts
50
Posts %
Top posts
answer
6
Is simply typed lambda calculus with fixed-point combinator Turing-complete?
Feb 13, 2017
answer
1
Given a polynomial-time algorithm, can we compute an explicit polynomial time bound just from the program?
Feb 17, 2017
Top network posts
View all network posts
22
Is it possible to evaluate lambda calculus terms efficiently?
14
Formal semantics of OCaml in Coq
13
2D convolution: Flipping the kernel?
12
Can a Turing machine perform Quicksort?
9
What it means lambda calculus is equivalent to turing machine