Author : Robert A. Hearn
Publisher : CRC Press
Page : 242 pages
File Size : 44,6 MB
Release : 2009-06-30
Category : Mathematics
ISBN : 1439865051
The authors show that there are underlying mathematical reasons for why games and puzzles are challenging (and perhaps why they are so much fun). They also show that games and puzzles can serve as powerful models of computation-quite different from the usual models of automata and circuits-offering a new way of thinking about computation. The appen
Author : Dragomir Radev
Publisher : Springer Science & Business Media
Page : 208 pages
File Size : 22,91 MB
Release : 2013-02-11
Category : Language Arts & Disciplines
ISBN : 3642343724
This is the second volume of a unique collection that brings together the best English-language problems created for students competing in the Computational Linguistics Olympiad. These problems are representative of the diverse areas presented in the competition and designed with three principles in mind: · To challenge the student analytically, without requiring any explicit knowledge or experience in linguistics or computer science; · To expose the student to the different kinds of reasoning required when encountering a new phenomenon in a language, both as a theoretical topic and as an applied problem; · To foster the natural curiosity students have about the workings of their own language, as well as to introduce them to the beauty and structure of other languages; · To learn about the models and techniques used by computers to understand human language. Aside from being a fun intellectual challenge, the Olympiad mimics the skills used by researchers and scholars in the field of computational linguistics. In an increasingly global economy where businesses operate across borders and languages, having a strong pool of computational linguists is a competitive advantage, and an important component to both security and growth in the 21st century. This collection of problems is a wonderful general introduction to the field of linguistics through the analytic problem solving technique. "A fantastic collection of problems for anyone who is curious about how human language works! These books take serious scientific questions and present them in a fun, accessible way. Readers exercise their logical thinking capabilities while learning about a wide range of human languages, linguistic phenomena, and computational models. " - Kevin Knight, USC Information Sciences Institute
Author : Barry Cipra
Publisher : CRC Press
Page : 309 pages
File Size : 13,77 MB
Release : 2004-11-10
Category : Mathematics
ISBN : 1439864799
The tradition of a publication based on the Gathering for Gardner continues with this new carefully selected and edited collection in which Martin Gardner and friends inspire and entertain. The contributors to this volume---virtually a list of Who's Who in the World of Puzzles---trace their inspiration to Martin Gardner's puzzle column in Scientifi
Author : Peter Winkler
Publisher : CRC Press
Page : 392 pages
File Size : 48,43 MB
Release : 2021-01-21
Category : Mathematics
ISBN : 0429557973
Research in mathematics is much more than solving puzzles, but most people will agree that solving puzzles is not just fun: it helps focus the mind and increases one's armory of techniques for doing mathematics. Mathematical Puzzles makes this connection explicit by isolating important mathematical methods, then using them to solve puzzles and prove a theorem. Features A collection of the world’s best mathematical puzzles Each chapter features a technique for solving mathematical puzzles, examples, and finally a genuine theorem of mathematics that features that technique in its proof Puzzles that are entertaining, mystifying, paradoxical, and satisfying; they are not just exercises or contest problems.
Author : David G. Wells
Publisher : Cambridge University Press
Page : 257 pages
File Size : 22,71 MB
Release : 2012-10-18
Category : Games & Activities
ISBN : 1107024609
A unique book providing a tour through the fascinating connections between mathematics and games.
Author : John D. Beasley
Publisher : Courier Corporation
Page : 0 pages
File Size : 34,2 MB
Release : 2006
Category : Mathematics
ISBN : 9780486449760
Lucid, instructive, and full of surprises, this book examines how simple mathematical analysis can throw unexpected light on games of every type, from poker to golf to the Rubik's cube. 1989 edition.
Author : Erik D. Demaine
Publisher : Cambridge University Press
Page : 388 pages
File Size : 25,75 MB
Release : 2007-07-16
Category : Computers
ISBN : 1107394090
Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.
Author : Avi Wigderson
Publisher : Princeton University Press
Page : 434 pages
File Size : 33,70 MB
Release : 2019-10-29
Category : Computers
ISBN : 0691189137
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Author : Anany Levitin
Publisher : OUP USA
Page : 280 pages
File Size : 27,1 MB
Release : 2011-10-14
Category : Computers
ISBN : 0199740445
Algorithmic puzzles are puzzles involving well-defined procedures for solving problems. This book will provide an enjoyable and accessible introduction to algorithmic puzzles that will develop the reader's algorithmic thinking. The first part of this book is a tutorial on algorithm design strategies and analysis techniques. Algorithm design strategies — exhaustive search, backtracking, divide-and-conquer and a few others — are general approaches to designing step-by-step instructions for solving problems. Analysis techniques are methods for investigating such procedures to answer questions about the ultimate result of the procedure or how many steps are executed before the procedure stops. The discussion is an elementary level, with puzzle examples, and requires neither programming nor mathematics beyond a secondary school level. Thus, the tutorial provides a gentle and entertaining introduction to main ideas in high-level algorithmic problem solving. The second and main part of the book contains 150 puzzles, from centuries-old classics to newcomers often asked during job interviews at computing, engineering, and financial companies. The puzzles are divided into three groups by their difficulty levels. The first fifty puzzles in the Easier Puzzles section require only middle school mathematics. The sixty puzzle of average difficulty and forty harder puzzles require just high school mathematics plus a few topics such as binary numbers and simple recurrences, which are reviewed in the tutorial. All the puzzles are provided with hints, detailed solutions, and brief comments. The comments deal with the puzzle origins and design or analysis techniques used in the solution. The book should be of interest to puzzle lovers, students and teachers of algorithm courses, and persons expecting to be given puzzles during job interviews.
Author : Hector J. Levesque
Publisher : MIT Press
Page : 323 pages
File Size : 10,24 MB
Release : 2012-01-06
Category : Computers
ISBN : 0262300648
Students explore the idea that thinking is a form of computation by learning to write simple computer programs for tasks that require thought. This book guides students through an exploration of the idea that thinking might be understood as a form of computation. Students make the connection between thinking and computing by learning to write computer programs for a variety of tasks that require thought, including solving puzzles, understanding natural language, recognizing objects in visual scenes, planning courses of action, and playing strategic games. The material is presented with minimal technicalities and is accessible to undergraduate students with no specialized knowledge or technical background beyond high school mathematics. Students use Prolog (without having to learn algorithms: “Prolog without tears!”), learning to express what they need as a Prolog program and letting Prolog search for answers. After an introduction to the basic concepts, Thinking as Computation offers three chapters on Prolog, covering back-chaining, programs and queries, and how to write the sorts of Prolog programs used in the book. The book follows this with case studies of tasks that appear to require thought, then looks beyond Prolog to consider learning, explaining, and propositional reasoning. Most of the chapters conclude with short bibliographic notes and exercises. The book is based on a popular course at the University of Toronto and can be used in a variety of classroom contexts, by students ranging from first-year liberal arts undergraduates to more technically advanced computer science students.
