Computer Science
Profile Activity
Meta user
Network profile
28,663
reputation
5
59
115

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.

305
answers
43
questions
~698k
people reached

Communities (43)

Top Meta Posts
3
5

Top network posts

Top tags (203)

Score 543
Posts 44
Posts % 13
Score 447
Posts 51
Score 378
Posts 47
Score 197
Posts 41
Score 160
Posts 41
Score 156
Posts 35
View all tags →

Top posts (348)

All Questions Answers
Votes Newest
232 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
54 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 (179)

Gold

5

Rarest

Silver

59

Rarest

Bronze

115

Rarest

View all badges →

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.