Theoretical Computer Science
Andrea Asperti's user avatar
Andrea Asperti's user avatar
Andrea Asperti's user avatar
Andrea Asperti
  • Member for 6 years, 9 months
  • Last seen more than a month ago
Profile Activity
Stats
631
reputation
7k
reached
5
answers
3
questions
Communities
View all
About

I am Professor of Computer Science at the University of Bologna

Badges
View all badges
This user doesn’t have any gold badges yet.
6
silver badges
11
bronze badges
Top tags
View all tags
13
Score
2
Posts
25
Posts %
9
Score
2
Posts
25
Posts %
9
Score
1
Posts
12
Posts %
7
Score
1
Posts
12
Posts %
7
Score
1
Posts
12
Posts %
4
Score
1
Posts
12
Posts %
Top posts
All Questions Answers
Score Newest
question
14
Formal semantics of OCaml in Coq
Feb 28, 2017
answer
9
Understanding between lambda-calculus and other abstract machines (like Turing machine and Markov algorithm)
Feb 8, 2017
question
8
About the origin of the names "immune" and "simple"
Feb 13, 2017
answer
7
"Impredicative" in type theory
Mar 6, 2017
answer
4
How to state the adequacy of an encoding of lambda calculus in itself?
Mar 13, 2017
answer
4
Are runtime bounds in P decidable? (answer: no)
Feb 14, 2017
question
4
About the decidability of sets enumerated in non decreasing order
May 12, 2017
answer
3
Are there decidable problems for which for no algorithm we can give time bounds?
Feb 17, 2017
Top network posts
View all network posts
21
Is it possible to evaluate lambda calculus terms efficiently?
13
2D convolution: Flipping the kernel?
12
Can a Turing machine perform Quicksort?
10
What it means lambda calculus is equivalent to turing machine
7
Differences between time complexity and space complexity?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.