Thinking Recursively

Download Thinking Recursively full books in PDF, epub, and Kindle. Read online Thinking Recursively ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!

Thinking Recursively

Author : Eric Roberts
Publisher : John Wiley & Sons
ISBN 13 :
Total Pages : 200 pages
Book Rating : 4.3/5 (91 download)

DOWNLOAD NOW!

Book Synopsis Thinking Recursively by : Eric Roberts

Download or read book Thinking Recursively written by Eric Roberts and published by John Wiley & Sons. This book was released on 1986-01-17 with total page 200 pages. Available in PDF, EPUB and Kindle. Book excerpt: The process of solving large problems by breaking them down intosmaller, more simple problems that have identical forms. ThinkingRecursively: A small text to solve large problems. Concentrating onthe practical value of recursion. this text, the first of its kind,is essential to computer science students' education. In thistext, students will learn the concept and programming applicationsof recursive thinking. This will ultimately prepare students foradvanced topics in computer science such as compiler construction,formal language theory, and the mathematical foundations ofcomputer science. Key Features: * Concentration on the practical value of recursion. * Eleven chapters emphasizing recursion as a unifiedconcept. * Extensive discussion of the mathematical concepts which helpthe students to develop an appropriate conceptual model. * Large number of imaginative examples with solutions. * Large sets of exercises.

Think Like a Programmer

Author : V. Anton Spraul
Publisher : No Starch Press
ISBN 13 : 1593274564
Total Pages : 260 pages
Book Rating : 4.5/5 (932 download)

DOWNLOAD NOW!

Book Synopsis Think Like a Programmer by : V. Anton Spraul

Download or read book Think Like a Programmer written by V. Anton Spraul and published by No Starch Press. This book was released on 2012-08-12 with total page 260 pages. Available in PDF, EPUB and Kindle. Book excerpt: The real challenge of programming isn't learning a language's syntax—it's learning to creatively solve problems so you can build something great. In this one-of-a-kind text, author V. Anton Spraul breaks down the ways that programmers solve problems and teaches you what other introductory books often ignore: how to Think Like a Programmer. Each chapter tackles a single programming concept, like classes, pointers, and recursion, and open-ended exercises throughout challenge you to apply your knowledge. You'll also learn how to: –Split problems into discrete components to make them easier to solve –Make the most of code reuse with functions, classes, and libraries –Pick the perfect data structure for a particular job –Master more advanced programming tools like recursion and dynamic memory –Organize your thoughts and develop strategies to tackle particular types of problems Although the book's examples are written in C++, the creative problem-solving concepts they illustrate go beyond any particular language; in fact, they often reach outside the realm of computer science. As the most skillful programmers know, writing great code is a creative art—and the first step in creating your masterpiece is learning to Think Like a Programmer.

Introduction to Recursive Programming

Author : Manuel Rubio-Sanchez
Publisher : CRC Press
ISBN 13 : 1498735304
Total Pages : 451 pages
Book Rating : 4.4/5 (987 download)

DOWNLOAD NOW!

Book Synopsis Introduction to Recursive Programming by : Manuel Rubio-Sanchez

Download or read book Introduction to Recursive Programming written by Manuel Rubio-Sanchez and published by CRC Press. This book was released on 2017-10-05 with total page 451 pages. Available in PDF, EPUB and Kindle. Book excerpt: Recursion is one of the most fundamental concepts in computer science and a key programming technique that allows computations to be carried out repeatedly. Despite the importance of recursion for algorithm design, most programming books do not cover the topic in detail, despite the fact that numerous computer programming professors and researchers in the field of computer science education agree that recursion is difficult for novice students. Introduction to Recursive Programming provides a detailed and comprehensive introduction to recursion. This text will serve as a useful guide for anyone who wants to learn how to think and program recursively, by analyzing a wide variety of computational problems of diverse difficulty. It contains specific chapters on the most common types of recursion (linear, tail, and multiple), as well as on algorithm design paradigms in which recursion is prevalent (divide and conquer, and backtracking). Therefore, it can be used in introductory programming courses, and in more advanced classes on algorithm design. The book also covers lower-level topics related to iteration and program execution, and includes a rich chapter on the theoretical analysis of the computational cost of recursive programs, offering readers the possibility to learn some basic mathematics along the way. It also incorporates several elements aimed at helping students master the material. First, it contains a larger collection of simple problems in order to provide a solid foundation of the core concepts, before diving into more complex material. In addition, one of the book's main assets is the use of a step-by-step methodology, together with specially designed diagrams, for guiding and illustrating the process of developing recursive algorithms. Furthermore, the book covers combinatorial problems and mutual recursion. These topics can broaden students' understanding of recursion by forcing them to apply the learned concepts differently, or in a more sophisticated manner. The code examples have been written in Python 3, but should be straightforward to understand for students with experience in other programming languages. Finally, worked out solutions to over 120 end-of-chapter exercises are available for instructors.

Think Java

Author : Allen B. Downey
Publisher : "O'Reilly Media, Inc."
ISBN 13 : 1491929537
Total Pages : 251 pages
Book Rating : 4.4/5 (919 download)

DOWNLOAD NOW!

Book Synopsis Think Java by : Allen B. Downey

Download or read book Think Java written by Allen B. Downey and published by "O'Reilly Media, Inc.". This book was released on 2016-05-06 with total page 251 pages. Available in PDF, EPUB and Kindle. Book excerpt: Currently used at many colleges, universities, and high schools, this hands-on introduction to computer science is ideal for people with little or no programming experience. The goal of this concise book is not just to teach you Java, but to help you think like a computer scientist. You’ll learn how to program—a useful skill by itself—but you’ll also discover how to use programming as a means to an end. Authors Allen Downey and Chris Mayfield start with the most basic concepts and gradually move into topics that are more complex, such as recursion and object-oriented programming. Each brief chapter covers the material for one week of a college course and includes exercises to help you practice what you’ve learned. Learn one concept at a time: tackle complex topics in a series of small steps with examples Understand how to formulate problems, think creatively about solutions, and write programs clearly and accurately Determine which development techniques work best for you, and practice the important skill of debugging Learn relationships among input and output, decisions and loops, classes and methods, strings and arrays Work on exercises involving word games, graphics, puzzles, and playing cards

The Recursive Mind

Author : Michael C. Corballis
Publisher : Princeton University Press
ISBN 13 : 1400851491
Total Pages : 309 pages
Book Rating : 4.4/5 (8 download)

DOWNLOAD NOW!

Book Synopsis The Recursive Mind by : Michael C. Corballis

Download or read book The Recursive Mind written by Michael C. Corballis and published by Princeton University Press. This book was released on 2014-04-27 with total page 309 pages. Available in PDF, EPUB and Kindle. Book excerpt: A groundbreaking theory of what makes the human mind unique The Recursive Mind challenges the commonly held notion that language is what makes us uniquely human. In this compelling book, Michael Corballis argues that what distinguishes us in the animal kingdom is our capacity for recursion: the ability to embed our thoughts within other thoughts. "I think, therefore I am," is an example of recursive thought, because the thinker has inserted himself into his thought. Recursion enables us to conceive of our own minds and the minds of others. It also gives us the power of mental "time travel"—the ability to insert past experiences, or imagined future ones, into present consciousness. Drawing on neuroscience, psychology, animal behavior, anthropology, and archaeology, Corballis demonstrates how these recursive structures led to the emergence of language and speech, which ultimately enabled us to share our thoughts, plan with others, and reshape our environment to better reflect our creative imaginations. He shows how the recursive mind was critical to survival in the harsh conditions of the Pleistocene epoch, and how it evolved to foster social cohesion. He traces how language itself adapted to recursive thinking, first through manual gestures, then later, with the emergence of Homo sapiens, vocally. Toolmaking and manufacture arose, and the application of recursive principles to these activities in turn led to the complexities of human civilization, the extinction of fellow large-brained hominins like the Neandertals, and our species' supremacy over the physical world.

Think Julia

Author : Ben Lauwens
Publisher : O'Reilly Media
ISBN 13 : 1492045004
Total Pages : 298 pages
Book Rating : 4.4/5 (92 download)

DOWNLOAD NOW!

Book Synopsis Think Julia by : Ben Lauwens

Download or read book Think Julia written by Ben Lauwens and published by O'Reilly Media. This book was released on 2019-04-05 with total page 298 pages. Available in PDF, EPUB and Kindle. Book excerpt: If you’re just learning how to program, Julia is an excellent JIT-compiled, dynamically typed language with a clean syntax. This hands-on guide uses Julia 1.0 to walk you through programming one step at a time, beginning with basic programming concepts before moving on to more advanced capabilities, such as creating new types and multiple dispatch. Designed from the beginning for high performance, Julia is a general-purpose language ideal for not only numerical analysis and computational science but also web programming and scripting. Through exercises in each chapter, you’ll try out programming concepts as you learn them. Think Julia is perfect for students at the high school or college level as well as self-learners and professionals who need to learn programming basics. Start with the basics, including language syntax and semantics Get a clear definition of each programming concept Learn about values, variables, statements, functions, and data structures in a logical progression Discover how to work with files and databases Understand types, methods, and multiple dispatch Use debugging techniques to fix syntax, runtime, and semantic errors Explore interface design and data structures through case studies

How to Design Programs, second edition

Author : Matthias Felleisen
Publisher : MIT Press
ISBN 13 : 0262344122
Total Pages : 793 pages
Book Rating : 4.2/5 (623 download)

DOWNLOAD NOW!

Book Synopsis How to Design Programs, second edition by : Matthias Felleisen

Download or read book How to Design Programs, second edition written by Matthias Felleisen and published by MIT Press. This book was released on 2018-05-25 with total page 793 pages. Available in PDF, EPUB and Kindle. Book excerpt: A completely revised edition, offering new design recipes for interactive programs and support for images as plain values, testing, event-driven programming, and even distributed programming. This introduction to programming places computer science at the core of a liberal arts education. Unlike other introductory books, it focuses on the program design process, presenting program design guidelines that show the reader how to analyze a problem statement, how to formulate concise goals, how to make up examples, how to develop an outline of the solution, how to finish the program, and how to test it. Because learning to design programs is about the study of principles and the acquisition of transferable skills, the text does not use an off-the-shelf industrial language but presents a tailor-made teaching language. For the same reason, it offers DrRacket, a programming environment for novices that supports playful, feedback-oriented learning. The environment grows with readers as they master the material in the book until it supports a full-fledged language for the whole spectrum of programming tasks. This second edition has been completely revised. While the book continues to teach a systematic approach to program design, the second edition introduces different design recipes for interactive programs with graphical interfaces and batch programs. It also enriches its design recipes for functions with numerous new hints. Finally, the teaching languages and their IDE now come with support for images as plain values, testing, event-driven programming, and even distributed programming.

Recursively Enumerable Sets and Degrees

Author : Robert I. Soare
Publisher : Springer Science & Business Media
ISBN 13 : 9783540152996
Total Pages : 460 pages
Book Rating : 4.1/5 (529 download)

DOWNLOAD NOW!

Book Synopsis Recursively Enumerable Sets and Degrees by : Robert I. Soare

Download or read book Recursively Enumerable Sets and Degrees written by Robert I. Soare and published by Springer Science & Business Media. This book was released on 1999-11-01 with total page 460 pages. Available in PDF, EPUB and Kindle. Book excerpt: ..."The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees. .... The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness. The book is highly recommended to everyone interested in logic. It also provides a useful background to computer scientists, in particular to theoretical computer scientists." Acta Scientiarum Mathematicarum, Ungarn 1988 ..."The main purpose of this book is to introduce the reader to the main results and to the intricacies of the current theory for the recurseively enumerable sets and degrees. The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be." Zentralblatt für Mathematik, 623.1988

Discovering the Brain

Author : National Academy of Sciences
Publisher : National Academies Press
ISBN 13 : 0309045290
Total Pages : 195 pages
Book Rating : 4.3/5 (9 download)

DOWNLOAD NOW!

Book Synopsis Discovering the Brain by : National Academy of Sciences

Download or read book Discovering the Brain written by National Academy of Sciences and published by National Academies Press. This book was released on 1992-01-01 with total page 195 pages. Available in PDF, EPUB and Kindle. Book excerpt: The brain ... There is no other part of the human anatomy that is so intriguing. How does it develop and function and why does it sometimes, tragically, degenerate? The answers are complex. In Discovering the Brain, science writer Sandra Ackerman cuts through the complexity to bring this vital topic to the public. The 1990s were declared the "Decade of the Brain" by former President Bush, and the neuroscience community responded with a host of new investigations and conferences. Discovering the Brain is based on the Institute of Medicine conference, Decade of the Brain: Frontiers in Neuroscience and Brain Research. Discovering the Brain is a "field guide" to the brainâ€"an easy-to-read discussion of the brain's physical structure and where functions such as language and music appreciation lie. Ackerman examines: How electrical and chemical signals are conveyed in the brain. The mechanisms by which we see, hear, think, and pay attentionâ€"and how a "gut feeling" actually originates in the brain. Learning and memory retention, including parallels to computer memory and what they might tell us about our own mental capacity. Development of the brain throughout the life span, with a look at the aging brain. Ackerman provides an enlightening chapter on the connection between the brain's physical condition and various mental disorders and notes what progress can realistically be made toward the prevention and treatment of stroke and other ailments. Finally, she explores the potential for major advances during the "Decade of the Brain," with a look at medical imaging techniquesâ€"what various technologies can and cannot tell usâ€"and how the public and private sectors can contribute to continued advances in neuroscience. This highly readable volume will provide the public and policymakersâ€"and many scientists as wellâ€"with a helpful guide to understanding the many discoveries that are sure to be announced throughout the "Decade of the Brain."

Joe Celko's Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL

Author : Joe Celko
Publisher : Morgan Kaufmann
ISBN 13 : 008055752X
Total Pages : 383 pages
Book Rating : 4.0/5 (85 download)

DOWNLOAD NOW!

Book Synopsis Joe Celko's Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL by : Joe Celko

Download or read book Joe Celko's Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL written by Joe Celko and published by Morgan Kaufmann. This book was released on 2008-01-22 with total page 383 pages. Available in PDF, EPUB and Kindle. Book excerpt: Perfectly intelligent programmers often struggle when forced to work with SQL. Why? Joe Celko believes the problem lies with their procedural programming mindset, which keeps them from taking full advantage of the power of declarative languages. The result is overly complex and inefficient code, not to mention lost productivity.This book will change the way you think about the problems you solve with SQL programs.. Focusing on three key table-based techniques, Celko reveals their power through detailed examples and clear explanations. As you master these techniques, you'll find you are able to conceptualize problems as rooted in sets and solvable through declarative programming. Before long, you'll be coding more quickly, writing more efficient code, and applying the full power of SQL - Filled with the insights of one of the world's leading SQL authorities - noted for his knowledge and his ability to teach what he knows - Focuses on auxiliary tables (for computing functions and other values by joins), temporal tables (for temporal queries, historical data, and audit information), and virtual tables (for improved performance) - Presents clear guidance for selecting and correctly applying the right table technique

Recursion Theory for Metamathematics

Author : Raymond M. Smullyan
Publisher : Oxford University Press
ISBN 13 : 0195344812
Total Pages : 180 pages
Book Rating : 4.1/5 (953 download)

DOWNLOAD NOW!

Book Synopsis Recursion Theory for Metamathematics by : Raymond M. Smullyan

Download or read book Recursion Theory for Metamathematics written by Raymond M. Smullyan and published by Oxford University Press. This book was released on 1993-01-28 with total page 180 pages. Available in PDF, EPUB and Kindle. Book excerpt: This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

Verified Functional Programming in Agda

Author : Aaron Stump
Publisher : Morgan & Claypool
ISBN 13 : 1970001267
Total Pages : 328 pages
Book Rating : 4.9/5 (7 download)

DOWNLOAD NOW!

Book Synopsis Verified Functional Programming in Agda by : Aaron Stump

Download or read book Verified Functional Programming in Agda written by Aaron Stump and published by Morgan & Claypool. This book was released on 2016-02-01 with total page 328 pages. Available in PDF, EPUB and Kindle. Book excerpt: Agda is an advanced programming language based on Type Theory. Agda's type system is expressive enough to support full functional verification of programs, in two styles. In external verification, we write pure functional programs and then write proofs of properties about them. The proofs are separate external artifacts, typically using structural induction. In internal verification, we specify properties of programs through rich types for the programs themselves. This often necessitates including proofs inside code, to show the type checker that the specified properties hold. The power to prove properties of programs in these two styles is a profound addition to the practice of programming, giving programmers the power to guarantee the absence of bugs, and thus improve the quality of software more than previously possible. Verified Functional Programming in Agda is the first book to provide a systematic exposition of external and internal verification in Agda, suitable for undergraduate students of Computer Science. No familiarity with functional programming or computer-checked proofs is presupposed. The book begins with an introduction to functional programming through familiar examples like booleans, natural numbers, and lists, and techniques for external verification. Internal verification is considered through the examples of vectors, binary search trees, and Braun trees. More advanced material on type-level computation, explicit reasoning about termination, and normalization by evaluation is also included. The book also includes a medium-sized case study on Huffman encoding and decoding.

Recursivity and Contingency

Author : Yuk Hui
Publisher : Rowman & Littlefield
ISBN 13 : 1786600544
Total Pages : 337 pages
Book Rating : 4.7/5 (866 download)

DOWNLOAD NOW!

Book Synopsis Recursivity and Contingency by : Yuk Hui

Download or read book Recursivity and Contingency written by Yuk Hui and published by Rowman & Littlefield. This book was released on 2019-01-28 with total page 337 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book employs recursivity and contingency as two principle concepts to investigate into the relation between nature and technology, machine and organism, system and freedom. It reconstructs a trajectory of thought from an Organic condition of thinking elaborated by Kant, passing by the philosophy of nature (Schelling and Hegel), to the 20th century Organicism (Bertalanffy, Needham, Whitehead, Wiener among others) and Organology (Bergson, Canguilhem, Simodnon, Stiegler), and questions the new condition of philosophizing in the time of algorithmic contingency, ecological and algorithmic catastrophes, which Heidegger calls the end of philosophy. The book centres on the following speculative question: if in the philosophical tradition, the concept of contingency is always related to the laws of nature, then in what way can we understand contingency in related to technical systems? The book situates the concept of recursivity as a break from the Cartesian mechanism and the drive of system construction; it elaborates on the necessity of contingency in such epistemological rupture where nature ends and system emerges. In this development, we see how German idealism is precursor to cybernetics, and the Anthropocene and Noosphere (Teilhard de Chardin) point toward the realization of a gigantic cybernetic system, which lead us back to the question of freedom. It questions the concept of absolute contingency (Meillassoux) and proposes a cosmotechnical pluralism. Engaging with modern and contemporary European philosophy as well as Chinese thought through the mediation of Needham, this book refers to cybernetics, mathematics, artificial intelligence and inhumanism.

How to Think About Algorithms

Author : Jeff Edmonds
Publisher : Cambridge University Press
ISBN 13 : 1139471759
Total Pages : 409 pages
Book Rating : 4.1/5 (394 download)

DOWNLOAD NOW!

Book Synopsis How to Think About Algorithms by : Jeff Edmonds

Download or read book How to Think About Algorithms written by Jeff Edmonds and published by Cambridge University Press. This book was released on 2008-05-19 with total page 409 pages. Available in PDF, EPUB and Kindle. Book excerpt: This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.

Simply Scheme

Author : Brian Harvey
Publisher : MIT Press
ISBN 13 : 9780262082815
Total Pages : 620 pages
Book Rating : 4.0/5 (828 download)

DOWNLOAD NOW!

Book Synopsis Simply Scheme by : Brian Harvey

Download or read book Simply Scheme written by Brian Harvey and published by MIT Press. This book was released on 1999 with total page 620 pages. Available in PDF, EPUB and Kindle. Book excerpt: Showing off scheme - Functions - Expressions - Defining your own procedures - Words and sentences - True and false - Variables - Higher-order functions - Lambda - Introduction to recursion - The leap of faith - How recursion works - Common patterns in recursive procedures - Advanced recursion - Example : the functions program - Files - Vectors - Example : a spreadsheet program - Implementing the spreadsheet program - What's next?

Logical Methods

Author : Roger Antonsen
Publisher : Springer
ISBN 13 : 9783030637767
Total Pages : 288 pages
Book Rating : 4.6/5 (377 download)

DOWNLOAD NOW!

Book Synopsis Logical Methods by : Roger Antonsen

Download or read book Logical Methods written by Roger Antonsen and published by Springer. This book was released on 2021-02-11 with total page 288 pages. Available in PDF, EPUB and Kindle. Book excerpt: Many believe mathematics is only about calculations, formulas, numbers, and strange letters. But mathematics is much more than just crunching numbers or manipulating symbols. Mathematics is about discovering patterns, uncovering hidden structures, finding counterexamples, and thinking logically. Mathematics is a way of thinking. It is an activity that is both highly creative and challenging. This book offers an introduction to mathematical reasoning for beginning university or college students, providing a solid foundation for further study in mathematics, computer science, and related disciplines. Written in a manner that directly conveys the sense of excitement and discovery at the heart of doing science, its 25 short and visually appealing chapters cover the basics of set theory, logic, proof methods, combinatorics, graph theory, and much more. In the book you will, among other things, find answers to: What is a proof? What is a counterexample? What does it mean to say that something follows logically from a set of premises? What does it mean to abstract over something? How can knowledge and information be represented and used in calculations? What is the connection between Morse code and Fibonacci numbers? Why could it take billions of years to solve Hanoi's Tower? Logical Methods is especially appropriate for students encountering such concepts for the very first time. Designed to ease the transition to a university or college level study of mathematics or computer science, it also provides an accessible and fascinating gateway to logical thinking for students of all disciplines.

Computational Thinking

Author : Paolo Ferragina
Publisher : Springer Nature
ISBN 13 : 3031599225
Total Pages : 204 pages
Book Rating : 4.0/5 (315 download)

DOWNLOAD NOW!

Book Synopsis Computational Thinking by : Paolo Ferragina

Download or read book Computational Thinking written by Paolo Ferragina and published by Springer Nature. This book was released on 2024 with total page 204 pages. Available in PDF, EPUB and Kindle. Book excerpt: A topic important to pre-university as well as to university curricula for computing and various other disciplines, computational thinking examines processes in the mind engaged in addressing problems such that answers/solutions can be formulated as computational increments and then, algorithms. This revised and updated textbook/guide offers a gentle motivation and introduction to computational thinking, in particular to algorithms and how they can be coded to solve significant, topical real problems from domains such as finance, cryptography, web search, data compression and bioinformatics. Although the work assumes only basic mathematical knowledge, it still upholds the scientific rigor indispensable for transforming general ideas into executable algorithms, giving several solutions to common tasks, taken from topics of our everyday world. Topics and features: Provides a readily accessible introduction, suitable for undergraduate and high-school students, as well as for self-study Organizes content neatly and conveniently by application or problem area Offers a helpful supporting website with Python code that implements the algorithms in the book Anchors the content practically, examining an excellent variety of modern topics in a concise volume Assumes knowledge of only basic computing skills as a prerequisite Written by highly experienced lecturers, as well as researchers of world renown A unique and reader-friendly textbook/reference, the title is eminently suitable for undergraduate students in computer science, engineering, and applied mathematics, university students in other fields, high-school students with an interest in STEM subjects, and professionals who want an insight into algorithmic solutions and the related mindset. Paolo Ferragina is professor of computer science at the Sant’Anna School of Advanced Studies, Italy, and Fabrizio Luccio is an emeritus professor of computer science at the University of Pisa, Italy.