"Learnability can be undecideable" argues that the current mathematical frameworks we use to understand learnability are deeply flawed. It has been making big waves in the machine learning community, due to its rather spicy thesis. Thus, I figured it would be a good paper for me to review, and to explain its argument and implications.… Continue reading Paper Review: Learnability can be undecideable
Author: Daniel Herrmann
I am a postdoctoral scholar in the department of theoretical philosophy at the University of Groningen. I focus mainly on game/decision theory and formal epistemology, and the philosophy of AI.
The Crow's Nest 