Abstract
A new class of abstract computational devices, counter machines with summator (CS machines), is introduced. It is shown that CS machines are universal computational devices: any general recursive function can be strictly computed on an appropriate CS machine.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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: Moscow University Computational Mathematics and Cybernetics
Paper Title
Journal
Date
