Benjamin Rin

Benjamin Rin is an Assistant Professor in the Theoretical Philosophy group at the Department of Philosophy and Religious Studies, Utrecht University. He holds a BA in Mathematics from Bard College and a PhD in Philosophy from the University of California, Irvine (2014). His academic career includes postdoctoral work at UC Irvine and a lecturer/researcher role at the University of Amsterdam (2016), where he was affiliated with the Institute for Logic, Language, and Computation (ILLC) and Amsterdam University College (AUC).

Research Interests: Dr. Rin specializes in the intersection of logic, computation, and philosophy of mathematics. His work explores transfinite computation, infinite time Turing machines, modal logic, and the iterative conception of sets. Key themes include analyzing computational models with ordinal-length tapes, developing realizability semantics for modal logics, and studying the philosophical implications of infinitary computing.

Scientific Awards: No specific awards are mentioned in the provided texts.

Recent Publications: His 2024 Arimaa Is PSPACE-Hard examines computational complexity in algorithmic games, while 2020's Reachability for infinite time Turing machines investigates extended Turing machine behavior. Earlier works focus on modal logic semantics, transfinite recursion, and infinitary propositional languages.

Teaching & Networks: He teaches at Utrecht University and is affiliated with the Humanities Research Institute for Philosophy and Religious Studies. His research network includes collaborations with scholars like Merlin Carl, Benedikt Löwe, and Philip Welch.