Computer Science
Profile Activity
Meta user
Network profile
26,491
reputation
5
54
108

jmite

I am Joey Eremondi, a PhD Student at the University of British Columbia.

I do research in Programming Languages and Theory of Computation, particularly with dependent types. My Masters Thesis was on improving error messages for higher order unification. I've also co-authored a few papers on reversal-bounded counter automata.

I have an M.Sc in Computing Science from Utrecht University, a B.Sc. Honours in Computer Science, and a B.Sc. 4-year in Mathematics, both from the University of Saskatchewan.

286
answers
43
questions
~570k
people reached
  • University of British Columbia
  • JoeyEremondi
  • eremondi.com
  • Member for 7 years, 8 months
  • 1,730 profile views
  • Last seen 13 hours ago

Communities (43)

Top Meta Posts
3
5

Top network posts

Top tags (199)

Score 511
Posts 41
Posts % 12
Score 393
Posts 47
Score 308
Posts 44
Score 186
Posts 39
Score 152
Posts 35
Score 137
Posts 35
View all tags →

Top posts (329)

All Questions Answers
Votes Newest
222 Why, really, is the Halting Problem so important? Nov 8 '14
94 If everyone believes P ≠ NP, why is everyone sceptical of proof attempts for P ≠ NP? Oct 19 '17
64 Dependent types vs refinement types Feb 17 '14
58 Is there anything that MUST be done on a multi-core CPU? Mar 4 '16
57 Are there programs that can 'translate' source code between any two languages? Dec 12 '16
57 Proof that dead code cannot be detected by compilers Nov 10 '15
53 What is the difference between an algorithm, a language and a problem? Aug 8 '13
50 Meaning of: “'If factoring large integers is hard, then breaking RSA is hard,' is unproven” Dec 13 '15
45 Why is overfitting bad? Jan 6 '16
40 Assuming P = NP, how would one solve the graph coloring problem in polynomial time? Mar 12
View all questions and answers →

Badges (167)

Gold

5

Rarest

Silver

54

Rarest

Bronze

108

Rarest

View all badges →