Výsledky vyhľadávania - abstract and (automatic OR automation) compatibility and recursion theory

A new order-theoretic characterisation of the polytime computable functions Autor Avanzini, Martin, Eguchi, Naohi, Moser, Georg

“…: for any rewrite system compatible with sPOP⁎ that employs recursion up to depth d, the (innermost) runtime complexity is polynomially bounded of degree d…”
Získať plný text