2 citations to 10.1007/s00224-016-9698-9 (Crossref Cited-By Service)

1. Alexander Rybalov, “On a generic Turing reducibility of computably enumerable sets”, J. Phys.: Conf. Ser., 1210, 2019, 012122  
2. Cristian S. Calude, Monica Dumitrescu, Benedikt Löwe, “A probabilistic anytime algorithm for the halting problem”, COM, 7, № 2-3, 2018, 259