3 citations to 10.1515/gcc-2015-0015 (Crossref Cited-By Service)

1. Alexander Rybalov, “On a generic Turing reducibility of computably enumerable sets”, J. Phys.: Conf. Ser., 1210, 2019, 012122  
2. A. N. Rybalov, “Generic Amplification of Recursively Enumerable Sets”, Algebra Logic, 57, no. 4, 2018, 289  
3. Alexander Rybalov, “On generic complexity of the problem of searching of isomorphism for finite semigroups”, J. Phys.: Conf. Ser., 1901, no. 1, 2021, 012045