Abstract
Thes n m function defined in the iteration theorem is shown to be quite subelementary through the use of stateless Turing machines. This means that recursion theorems can be used subrecursively with no change in computational complexity.
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 callMore From: International Journal of Computer & Information Sciences
Paper Title
Journal
Date
