Computer Science
Profile Activity
Meta user
Network profile
27,986
reputation
5
57
110

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.

297
answers
43
questions
~641k
people reached
  • University of British Columbia
  • JoeyEremondi
  • eremondi.com
  • Member for 8 years, 6 months
  • 1,952 profile views
  • Last seen 11 hours ago

Communities (43)

Top Meta Posts
3
5

Top network posts

Top tags (200)

Score 519
Posts 41
Posts % 12
Score 429
Posts 49
Score 364
Posts 45
Score 187
Posts 39
Score 154
Posts 35
Score 148
Posts 38
View all tags →

Top posts (340)

All Questions Answers
Votes Newest
230 Why, really, is the Halting Problem so important? Nov 8 '14
95 If everyone believes P ≠ NP, why is everyone sceptical of proof attempts for P ≠ NP? Oct 19 '17
66 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
55 Why do more powerful programming languages tend to have slower implementations? Jun 21 '20
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
View all questions and answers →

Badges (172)

Gold

5

Rarest

Silver

57

Rarest

Bronze

110

Rarest

View all badges →