60 citations · 63 across the 7 of their papers we have counts for
1 paper · 2 filters
Ori Livson, Mikhail Prokopenko
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and comput…