Abstract

Abstract Computational capabilities of register machines with counters is investigated. It is shown that the class of functions that are strictly computable on register machines with counters agrees with that of total recursive functions.

Full Text
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 call