Abstract
We give function algebraic characterizations of the polynomial time computable functions using unbounded recursion schemes without introducing extra notions such as safe and normal in variables and tiering in word algebras.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
