We have Mindstorms to thank for that. In this book, pioneering computer scientist Seymour Papert uses the invention of LOGO, the first child-friendly programming language, to make the case for the value of teaching children with computers. Papert argues that children are more than capable of mastering computers, and that teaching computational processes like de-bugging in the classroom can change the way we learn everything else. He also shows that schools saturated with technology can actually improve socialization and interaction among students and between students and teachers.

    But facing the sea change that AI will bring can be paralyzing. How should companies set strategies, governments design policies, and people plan their lives for a world so different from what we know? In the face of such uncertainty, many analysts either cower in fear or predict an impossibly sunny future.But in Prediction Machines, three eminent economists recast the rise of AI as a drop in the cost of prediction. With this single, masterful stroke, they lift the curtain on the AI-is-magic hype and show how basic tools from economics provide clarity about the AI revolution and a basis for action by CEOs, managers, policy makers, investors, and entrepreneurs.When AI is framed as cheap prediction, its extraordinary potential becomes clear: Prediction is at the heart of making decisions under uncertainty. Our businesses and personal lives are riddled with such decisions. Prediction tools increase productivity--operating machines, handling documents, communicating with customers. Uncertainty constrains strategy. Better prediction creates opportunities for new business structures and strategies to compete. Penetrating, fun, and always insightful and practical, Prediction Machines follows its inescapable logic to explain how to navigate the changes on the horizon. The impact of AI will be profound, but the economic framework for understanding it is surprisingly simple.

    The novel approach taken here banishes determinants to the end of the book and focuses on the central goal of linear algebra: understanding the structure of linear operators on vector spaces. The author has taken unusual care to motivate concepts and to simplify proofs. For example, the book presents - without having defined determinants - a clean proof that every linear operator on a finite-dimensional complex vector space (or an odd-dimensional real vector space) has an eigenvalue. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra. This second edition includes a new section on orthogonal projections and minimization problems. The sections on self-adjoint operators, normal operators, and the spectral theorem have been rewritten. New examples and new exercises have been added, several proofs have been simplified, and hundreds of minor improvements have been made throughout the text.

    The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. KEY TOPICS: In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

    Haskell emerged in the last decade as a standard for lazy functional programming, a programming style where arguments are evaluated only when the value is actually needed. Haskell is a marvellous demonstration tool for logic and maths because its functional character allows implementations to remain very close to the concepts that get implemented, while the laziness permits smooth handling of infinite data structures.This book does not assume the reader to have previous experience with either programming or construction of formal proofs, but acquaintance with mathematical notation, at the level of secondary school mathematics is presumed. Everything one needs to know about mathematical reasoning or programming is explained as we go along. After proper digestion of the material in this book the reader will be able to write interesting programs, reason about their correctness, and document them in a clear fashion. The reader will also have learned how to set up mathematical proofs in a structured way, and how to read and digest mathematical proofs written by others.

    Much of the book takes the form of a discussion between a teacher and his students. They propose various solutions to some mathematical problems and investigate the strengths and weaknesses of these solutions. Their discussion (which mirrors certain real developments in the history of mathematics) raises some philosophical problems and some problems about the nature of mathematical discovery or creativity. Imre Lakatos is concerned throughout to combat the classical picture of mathematical development as a steady accumulation of established truths. He shows that mathematics grows instead through a richer, more dramatic process of the successive improvement of creative hypotheses by attempts to 'prove' them and by criticism of these attempts: the logic of proofs and refutations.

    There are updates throughout the book as well. These take into account important advances in cognitive psychology and the science of design while confirming and extending the book's basic thesis: that a physical symbol system has the necessary and sufficient means for intelligent action. The chapter "Economic Reality" has also been revised to reflect a change in emphasis in Simon's thinking about the respective roles of organizations and markets in economic systems."People sometimes ask me what they should read to find out about artificial intelligence. Herbert Simon's book The Sciences of the Artificial is always on the list I give them. Every page issues a challenge to conventional thinking, and the layman who digests it well will certainly understand what the field of artificial intelligence hopes to accomplish. I recommend it in the same spirit that I recommend Freud to people who ask about psychoanalysis, or Piaget to those who ask about child psychology: If you want to learn about a subject, start by reading its founding fathers." -- George A. Miller

    This report, part of the GoodPlay Project, undertaken by researchers at Harvard Graduate School of Education's Project Zero, investigates the ethical fault lines of such digital pursuits. The authors argue that five key issues are at stake in the new media: identity, privacy, ownership and authorship, credibility, and participation. Drawing on evidence from informant interviews, emerging scholarship on new media, and theoretical insights from psychology, sociology, political science, and cultural studies, the report explores the ways in which youth may be redefining these concepts as they engage with new digital media. The authors propose a model of "good play" that involves the unique affordances of the new digital media; related technical and new media literacies; cognitive and moral development and values; online and offline peer culture; and ethical supports, including the absence or presence of adult mentors and relevant educational curricula. This proposed model for ethical play sets the stage for the next part of the GoodPlay project, an empirical study that will invite young people to share their stories of engagement with the new digital media.The John D. and Catherine T. MacArthur Foundation Reports on Digital Media and Learning

    Lewis Carroll’s Symbolic logic : part I, Elementary, 1896, fifth edition, part II, Advanced, never previously published : together with letters from Lewis Carroll to eminent nineteenth-century logicians and to his "logical sister," and eight versions of the Barber-shop paradox / edited, with annotations and an introd., by William Warren Bartley, III.

    Written in typical no-nonsense style, it lays out the basis of Mike's “minimalist” maintenance philosophy for owner-flown general aviation aircraft. An owner who follows the book's guidance can save a small fortune on maintenance costs and end up with a safer, more reliable aircraft.Owners are advised to perform the absolute least amount of maintenance required to make their aircraft safe, reliable and legal… and nothing more. The book explains in detail why engine and propeller TBOs and most other manufacturer-prescribed maintenance intervals should be disregarded. And “Manifesto” explains exactly how to do it.About the Author:Mike Busch is arguably the best-known A&P/IA in general aviation. In 2008, he was honored by the FAA as “National Aviation Maintenance Technician of the Year.” Mike has been a prolific aviation writer for more than four decades. His “Savvy Aviator” columns have appeared in numerous publications including EAA Sport Aviation, AOPA’s Opinion Leader’s Blog, AVweb, and magazines for the three largest GA type clubs (ABS, CPA, and COPA). He is renowned for his free monthly maintenance webinars and his standing-room-only forums at EAA AirVenture Oshkosh. Mike has been a pilot and aircraft owner for 45 years with 7,500+ hours logged, and he is a CFIA/I/ME. He’s founder and CEO of Savvy Aircraft Maintenance Management, Inc., the world’s largest firm providing maintenance-management services for owner-flown aircraft.

    Today, unfortunately, the traditional place of mathematics in education is in grave danger. The teaching and learning of mathematics has degenerated into the realm of rote memorization, the outcome of which leads to satisfactory formal ability but does not lead to real understanding or to greater intellectual independence. This new edition of Richard Courant's and Herbert Robbins's classic work seeks to address this problem. Its goal is to put the meaning back into mathematics.Written for beginners and scholars, for students and teachers, for philosophers and engineers, What is Mathematics? Second Edition is a sparkling collection of mathematical gems that offers an entertaining and accessible portrait of the mathematical world. Covering everything from natural numbers and the number system to geometrical constructions and projective geometry, from topology and calculus to matters of principle and the Continuum Hypothesis, this fascinating survey allows readers to delve into mathematics as an organic whole rather than an empty drill in problem solving. With chapters largely independent of one another and sections that lead upward from basic to more advanced discussions, readers can easily pick and choose areas of particular interest without impairing their understanding of subsequent parts.Brought up to date with a new chapter by Ian Stewart, What is Mathematics? Second Edition offers new insights into recent mathematical developments and describes proofs of the Four-Color Theorem and Fermat's Last Theorem, problems that were still open when Courant and Robbins wrote this masterpiece, but ones that have since been solved.Formal mathematics is like spelling and grammar - a matter of the correct application of local rules. Meaningful mathematics is like journalism - it tells an interesting story. But unlike some journalism, the story has to be true. The best mathematics is like literature - it brings a story to life before your eyes and involves you in it, intellectually and emotionally. What is Mathematics is like a fine piece of literature - it opens a window onto the world of mathematics for anyone interested to view.

    The study of type systems--and of programming languages from a type-theoretic perspective--has important applications in software engineering, language design, high-performance compilers, and security.This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.

    Now delete that picture. In Once Upon an Algorithm, Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example: You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm.Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter's world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; "intractable" problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms.This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning.