11 citations to 10.1016/j.tcs.2007.02.010 (Crossref Cited-By Service)
  1. Alexander Rybalov, “On a generic Turing reducibility of computably enumerable sets”, J. Phys.: Conf. Ser., 1210, 2019, 012122  crossref
  2. Dale Jacquette, “Computable Diagonalizations and Turing’s Cardinality Paradox”, J Gen Philos Sci, 45, № 2, 2014, 239  crossref
  3. Jorge Miguel Silva, Diogo Pratas, Rui Antunes, Sérgio Matos, Armando J. Pinho, “Automatic analysis of artistic paintings using information-based measures”, Pattern Recognition, 114, 2021, 107864  crossref
  4. Ali Mohammad Saghiri, S. Mehdi Vahidipour, Mohammad Reza Jabbarpour, Mehdi Sookhak, Agostino Forestiero, “A Survey of Artificial Intelligence Challenges: Analyzing the Definitions, Relationships, and Evolutions”, Applied Sciences, 12, № 8, 2022, 4054  crossref
  5. Alexander Rybalov, “On the Generic Undecidability of the Halting Problem for Normalized Turing Machines”, Theory Comput Syst, 60, № 4, 2017, 671  crossref
  6. Diogo Pratas, Raquel Silva, Armando Pinho, “Comparison of Compression-Based Measures with Application to the Evolution of Primate Genomes”, Entropy, 20, № 6, 2018, 393  crossref
  7. Alexei Myasnikov, 4649, Computer Science – Theory and Applications, 2007, 407  crossref
  8. S Gomathi Meena, S Dharani, “Artificial Intelligence Approaches and Mechanisms for Big Data Analytics: A Systematic Study”, jdaai, 2, № 3, 2023, 1  crossref
  9. Alexei G. Myasnikov, Alexander N. Rybalov, “Generic complexity of undecidable problems”, J. symb. log., 73, № 2, 2008, 656  crossref
  10. Eric P. Astor, “Asymptotic density, immunity and randomness”, COM, 4, № 2, 2015, 141  crossref
1
2
Следующая