Mark Burgin. Decidability and Universality in the Axiomatic Theory of Computability and Algorithms. Int. J. Found. Comput. Sci., 23(7):1465-1480, 2012. [doi]
@article{Burgin12,
title = {Decidability and Universality in the Axiomatic Theory of Computability and Algorithms},
author = {Mark Burgin},
year = {2012},
doi = {10.1142/S012905411240059X},
url = {http://dx.doi.org/10.1142/S012905411240059X},
researchr = {https://researchr.org/publication/Burgin12},
cites = {0},
citedby = {0},
journal = {Int. J. Found. Comput. Sci.},
volume = {23},
number = {7},
pages = {1465-1480},
}