Publisher
Springer International Publishing
Reference26 articles.
1. Axelsen, H.B., Glück, R.: What do reversible programs compute? In: Hofmann, M. (ed.) Foundations of Software Science and Computational Structures, pp. 42–56. Springer, Heidelberg (2011).
https://doi.org/10.1007/s00236-015-0253-y
2. Axelsen, H.B., Glück, R.: On reversible turing machines and their functionuniversality. Acta Informatica 53(5), 509–543 (2016).
https://doi.org/10.1007/s00236-015-0253-y
3. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973).
https://doi.org/10.1147/rd.176.0525
4. Birkhoff, G., Mac Lane, S.: A Survey of Modern Algebra, 4th edn. Macmillan, New York (1977)
5. Calude, C.: Theories of Computational Complexity. Elsevier (1988), annals of Discrete Mathematics - Monograph 35
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献