Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Showing 1 - 6 of 6 matches in All Departments
Martin Gardner has entertained the world with his puzzles for decades and inspired countless mathematicians and scientists. As he rounds out another decade, his colleagues are paying him tribute with this special collection that contains contributions from some of the most respected puzzlemasters, magicians and mathematicians, including: - John H. Conway - William R. Gosper - Ed Pegg, Jr. - Roger Penrose - Raymond Smullyan - Peter Winkler And of course there is something from the orignal puzzlemaster himself, Martin Gardner.
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 Scientific American and to his contributions to the world of recreational mathematics. Tribute to a Mathemagician contains an author index for the two previous books in the collection of books based on the Gatherings for Gardner. Sample puzzles and games include: - Tripos - Black Jack - Chinese ceramic puzzle vessels - Paper folding - Mongolian interlocking puzzles - Rolling block puzzles - Sliding puzzles - Cryptic crosswords - The Panex puzzle - Polyonimo puzzles - and more
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 Scientific American and to his contributions to the world of recreational mathematics. Tribute to a Mathemagician contains an author index for the two previous books in the collection of books based on the Gatherings for Gardner. Sample puzzles and games include: - Tripos - Black Jack - Chinese ceramic puzzle vessels - Paper folding - Mongolian interlocking puzzles - Rolling block puzzles - Sliding puzzles - Cryptic crosswords - The Panex puzzle - Polyonimo puzzles - and more
How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Durer in the early 1500s, but have only recently been studied in the mathematical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers.
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 appendices provide a substantial survey of all known results in the field of game complexity, serving as a reference guide for readers interested in the computational complexity of particular games, or interested in open problems about such complexities.
How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Durer in the early 1500s, but have only recently been studied in the mathematical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers.
|
You may like...
|