1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
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…