Computer Science
Meta user
Network profile
23,791
reputation
3
50
104

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.

283
answers
41
questions
~521k
people reached
  • University of British Columbia
  • JoeyEremondi
  • eremondi.com
  • Member for 7 years, 2 months
  • 1,577 profile views
  • Last seen 5 hours ago

Communities (43)

Top Meta Posts
3
5

Top network posts

Top tags (196)

Score 501
Posts 41
Posts % 13
Score 389
Posts 47
Score 305
Posts 44
Score 182
Posts 39
Score 153
Posts 35
Score 137
Posts 33
View all tags →

Top posts (324) All Questions Answers | Votes Newest

217 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
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
56 Dependent types vs refinement types Feb 17 '14
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
44 Why is overfitting bad? Jan 6 '16
39 What is the difference between an algorithm, a language and a problem? Aug 8 '13
View all questions and answers →

Badges (157)

Gold

3

Rarest

Silver

50

Rarest

Bronze

104

Rarest

View all badges →