The Evidence of the 'No Free Lunch' Theorems and the Theory of Complexity in Business Artificial Intelligence

For more than decades, the central drivers of business growth have been technological tools. The most important of these is Artificial Intelligence (AI). We name the paradigm “Business Artificial Intelligence (BAI)” the category of AI approaches that can create profitable new business models, earnest business-values, and more competitiveness, particularly Machine Learning (ML). However, ML algorithms are plentiful, and most of them necessitate specific Data structures, particular applicability features, and in-depth analysis of the business context. Because of these considerations, an increasing number of industrial ML-based applications fail. Therefore, it is natural to ask the question of applicability limits and ML algorithms selection, giving the business context. Accordingly, in this paper, we propose the evidence of the “No-Free-Lunch” (NFL) theorems to understand ML use’s applicability in business organizations.