Stephen Bellantoni is a contemporary philosopher and logician known for work at the intersection of computational complexity theory and the philosophy of logic. He is recognized for the Bellantoni-Cook characterization of polynomial-time computable functions via safe recursion, and has engaged with epistemological questions about the status of logical knowledge in light of computational constraints.
Co-developed the Bellantoni-Cook theorem characterizing polynomial-time functions via safe/normal variable distinction
Contributed to implicit computational complexity theory through predicative recursion
Explored philosophical tensions between the a priori status of logical knowledge and computational tractability