Computer Science
Meta user
Network profile
2,247
reputation
11
15

Alexey Romanov

A programmer and mathematician. Favorite languages: Haskell, Ruby, C#.
31
answers
1
question
~91k
people reached

Communities (47)

Top network posts

Top tags (52)

Score 30
Posts 5
Posts % 16
Score 23
Posts 3
Score 21
Posts 5
Score 19
Posts 4
Score 15
Posts 3
Score 13
Posts 4
View all tags →

Top posts (32) All Questions Answers | Votes Newest

43 Why is writing down mathematical proofs more fault-proof than writing computer code? Dec 12 '17
34 Why and how is a quantum computer faster than a regular computer? Feb 17 '14
14 Dependent types vs refinement types Feb 17 '14
10 NP-Hard problems which are not NP-Complete Nov 26 '12
9 Is L={<M>|M is a TM and L(M) is uncountable} decidable? Apr 19 '18
9 Advantages of algorithm W over algorithm J for type inference in Hindley-Milner type system Apr 3 '18
8 Big-O and not little-o implies theta? May 15 '16
8 Decision problem which belongs to P reduced to a decision problem which belongs to NP? Nov 29 '14
8 What is the difference between abstract and concrete data structures? Nov 15 '12
6 How come identity encodes absurdity Sep 21 '17
View all questions and answers →

Badges (26)

Gold

—

Silver

11

Rarest

Bronze

15

Rarest

View all badges →