138
click to vote
CIE
2007
Springer
16 years 1 days ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...