Mathematical algorithms for artificial intelligence
Roumiana Yossifova Ilieva, Kiril Anguelov, Yoto Plamenov Nikolov · AIP conference proceedings · 2019
Speaking for artificial intelligence and mathematics, some will say that they are two different fields. But we can assure you that mathematical models are its foundations, especially the main subset machine learning. Investigating these models and algorithms, we have the possibility to predict the abilities and limitations of artificial intelligence. Utilization of super-recursive algorithms for proving theorems, makes many such systems complete and decidable. Here we will discuss the main differences of recursive and super-recursive algorithm in particular Turing machine and inductive Turing machine. Our main statement is that artificial intelligent based on inductive Turing machine is much more powerful and will greatly enhance machine learning capabilities. As theorem proving and logic used commonly in artificial intelligence, these results will have a very important role in its implications.