🤖 AI Summary
This work proposes an innovative pedagogical framework for efficiently conveying the core ideas of programming and computation to beginners with only basic mathematical backgrounds within a 90-minute session. The approach employs a lightweight, category theory–inspired functional concatenative language, using gamified puzzles to intuitively illustrate fundamental concepts such as recursion and Gödel numbering. By grounding instruction in a minimal computational model, the method deliberately minimizes incidental complexity and departs from conventional introductory programming paradigms. Empirical evaluation demonstrates that this strategy significantly reduces cognitive load for novices while effectively transmitting the essence of computational thinking in an exceptionally short timeframe.
📝 Abstract
The advancement of automated coding tools may reduce in the future the number of people willing to learn computer programming. We assume that the skill of computational problem solving is not only for the immediate economic benefit, but an important part of our knowledge about the world. As the incentives to learn are weaker, we aim to lower the entry barrier. We ask: Can programming ideas be taught in a very short time?
We describe a session plan that introduces programming and computing fundamentals for novices, assuming only basic mathematical background. It requires using a non-mainstream, functional and concatenative language reducing accidental complexity. This language, a by-product of research in category theory, allows direct access to fundamental ideas like recursion and advanced like Gödel-encoding in an entertaining puzzle-like manner.