History Evolution and Modern Applications of AI

Lecture 3 of CS607 Artificial Intelligence traces the historical evolution of AI from its intellectual inception to modern industrial applications. The lecture reviews early gestation milestones, including Warren McCulloch and Walter Pitts' 1943 mathematical model of artificial neurons and Norbert Wiener's cybernetics. The formal birth of the field is situated at the landmark 1956 Dartmouth Summer Research Project organized by John McCarthy, Marvin Minsky, Nathaniel Rochester, and Claude Shannon, where the phrase 'Artificial Intelligence' was coined. Students examine the era of early enthusiasm and microworlds (such as Newell and Simon's Logic Theorist and General Problem Solver), followed by the harsh realities of computational intractability and combinatorial explosions that triggered the first AI Winter. The resurgence powered by domain-specific Expert Systems in the 1980s is analyzed alongside modern enterprise applications spanning autonomous vehicles, medical diagnostics, algorithmic financial trading, automated speech recognition, and intelligent personal assistants. Defuzzification techniques such as center of gravity and mean of maxima are applied to convert fuzzy inference outputs into crisp operational control signals. Supervised learning algorithms are contrasted regarding inductive bias, hypothesis space representations, and generalization capabilities on unseen data. Information theoretic metrics including entropy and information gain are computed to construct optimal decision trees using the ID3 algorithm. The curriculum traces the evolutionary transition from single-layer linear perceptrons to multi-layer feedforward networks trained via backpropagation. Practical considerations for activation function selection, learning rates, and gradient descent convergence provide rigorous quantitative decision support. Scholars examine how automated planning algorithms decompose high-level goals into partially ordered action sequences with verified causal links. Computer vision methodologies spanning edge detection, feature extraction, and image segmentation are evaluated alongside robotic kinematic architectures. Unsupervised clustering algorithms such as k-means are examined to discover latent taxonomic groupings within unlabelled multidimensional datasets. Minimax game tree evaluations demonstrate how optimal zero-sum strategies are determined in competitive two-player adversarial environments. Alpha-beta pruning mathematical cutoffs are analyzed, proving that identical game decisions are reached with significantly fewer evaluated board states.