@inproceedings{gurevich1983algebras,
author = {Gurevich, Yuri},
title = {Algebras of Feasible Functions},
booktitle = {24th Annual Symposium on Foundations of Computer Science IEEE Computer Society Press},
year = {1983},
month = {October},
abstract = {We prove that, under a natural interpretation over finite domains,
(i) a function is primitive recursive if and only if it is logspace computable, and
(ii)a function is general recursive if and only if it is polynomial time computable.},
url = {http://approjects.co.za/?big=en-us/research/publication/algebras-feasible-functions/},
pages = {210-214},
edition = {24th Annual Symposium on Foundations of Computer Science IEEE Computer Society Press},
}