This paper examines Turing's 1948 report, "Intelligent Machinery", as an important conceptual source for the later imitation games. Its first contribution is to identify and integrate the design concepts underlying the 1948 chess-based imitation game: the possibility that intelligent machines may make mistakes, the exclusion of irrelevant physical features, the role of the human judge, and Turing's claim that intellectual activity consists mainly of search. The paper's second contribution is to argue that restricting the human contestant to a rather poor chess player increases the role of intellectual search and makes human behaviour more comparable to machine behaviour. This interpretation presents the 1948 game as a human-approximates-machine game and suggests that the imitation game framework can be used not only to ask whether machines imitate humans, but also to examine when human intelligence becomes machine-like under specific task constraints.
Edmund C. Berkeley is usually remembered as a mediator between symbolic logic and early computing, yet that standard description understates the scope of his work. This paper argues for a stronger reading: Berkeley should also be understood as an early theorist of embodied machine intelligence. Across Berkeley's major writings on symbolic logic, machine intelligence, living robots, and Squee, intelligence appears not as disembodied symbol manipulation alone but as the organized coordination of sensing, storage, calculation, control, state, and action in physically realized machines. The paper's first contribution is interpretive: it reconstructs Berkeley as a thinker of machine architecture, temporally extended behavior, and environment-coupled control. Its second contribution is comparative: it reads Berkeley alongside David L. Heiserman to recover a shared descriptive scheme centered on sensing, state or memory, control, action, and adaptation. Its third contribution is critical: it uses that scheme to assess current embodied-AI discourse. The broader claim is that contemporary LLM-centered robotics often demonstrates impressive capability without an equally explicit account of persistence, recoverability, maintenance, and structured modification of conduct through experience.
Two major periods of reduced funding and confidence in artificial intelligence research, commonly called the first and second AI winters, are usually explained through engineering failure, commercial disappointment, and inflated expectations. This article develops a complementary thesis: that the dominant paradigms of those periods also met genuine formal barriers, including limitations of representation, optimisation, computational complexity, statistical learnability, and high-dimensional approximation. The contribution is synthetic rather than archival. We do not claim that particular theorems mechanically caused the winters; rather, we show that several central disappointments of early AI were aligned with mathematically precise bottlenecks. We analyse these bottlenecks through the perceptron impossibility results of Minsky and Papert, the complexity-theoretic hardness of exact neural-network training established by Blum and Rivest, minimax rates for nonparametric estimation in high dimension due to Stone, vanishing-gradient analyses by Hochreiter and by Bengio and collaborators, and classical statistical learning theory in the tradition of Vapnik and Chervonenkis, Valiant, and Blumer and collaborators. We then relate these barriers to the later breakthroughs that mitigated, rather than eliminated, them.