Decidability and Universality in the Axiomatic Theory of Computability and Algorithms

Mark Burgin. Decidability and Universality in the Axiomatic Theory of Computability and Algorithms. Int. J. Found. Comput. Sci., 23(7):1465-1480, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.