GOLSCO
Books Online Store
UK | Germany
books   baby   camera   computers   dvd   games   electronics   garden   kitchen   magazines   music   phones   software   tools   toys   video  
 Help  
Books - Science - Evolution - Game Theory - Books for a computer programmer/engineer.

1-6 of 6       1
Featured ListSimple List

Go to bottom to see all images

Click image to enlarge

On Numbers and Games
by John Horton Conway
Average Customer Review: 5.0 out of 5 stars
Hardcover (01 December, 2000)
list price: $39.00 -- our price: $39.00
(price subject to change: see help)
US | Canada | United Kingdom | Germany | France
Reviews (4)

5-0 out of 5 stars Mind-blowingly original, side-splittingly funny
This is not a book for mathematical beginners, even though it starts from literally nothing.But readers who have learned enough traditional math to understand the point of set theory and who have a solid grasp of the real number system are in for a wild ride, and will never look at numbers, or games, in the same way again.

Conway is the most original mathematician on the planet, as well as a remarkably witty and vivid writer, who combines wordplay and logic better than anyone since Lewis Carroll. The book is far too densely packed to summarize in a short review. All I can say is that it's practically inexhaustible; like all good math books, what you get out is proportional to the effort you make while reading it, but the amount of effort it will repay is a hundred times as much as for an ordinary book.

This is an all-time classic, a "desert island book".Even though this new edition differs from the old one in very minor ways, I bought it immediately because my 1978 copy was falling apart from extreme overuse.(My other "desert island math book" is Cohen's "Set Theory and the Continuum Hypothesis".)

5-0 out of 5 stars Math geek heaven
Boy, you wanna talk about your _cool_ books. I read this one twenty years ago and never quite got over it. Georg Cantor sure opened a can of worms with all that infinity stuff.

John Horton Conway is probably best known as the creator/discoverer of the computer game called "Life," with which he re-founded the entire field of cellular automata. What he does in this book is the _other_ thing he's best known for: he shows how to construct the "surreal numbers" (they were actually named by Donald Knuth).

Conway's method employs something like Dedekind cuts (the objects Richard Dedekind used to construct the real numbers from the rationals), but more general and much more powerful. Conway starts with the empty set and proceeds to construct the entire system of surreals, conjuring them forth from the void using a handful of recursive rules.

The idea is that we imagine numbers created on successive "days". On the first day, there's 0; on the next, -1 and +1; on the next, 2, 1/2, -1/2, and -2; on the next, 3, 3/4, 1/4, -1/4, -3/4, and -3; and so on. In the first countably-infinite round, we get all the numbers that can be written as a fraction whose denominator is a power of two (including, obviously, all the whole numbers). We can get as close to any other real number as we like, but they haven't actually been created yet at this point.

But we're just getting started. Once we get out past the first infinity, things really get weird. By the time we're through, which technically is "never," Conway's method has generated not only all the real numbers but way, way, way more besides (including more infinities than you've ever dreamed of). His system is so powerful that it includes the "hyperreal" numbers (infinitesimals and such) that emerge (by a very different route, of course) from Abraham Robinson's nonstandard analysis as a trivial special case.

So there's a lot here to get your mind around, and it's a lot of fun for readers who like to watch numbers being created out of nothing. But wait -- there's more.

See, the _full_ title of the book includes not only "numbers" but also "games". And that's the rest of the story. Conway noticed that in the board game of Go, there were certain patterns in the endgames such that each "game" looked like it could be constructed out of smaller "games". It turns out that something similar is true of all games that have certain properties, and that his surreal numbers tie into such games very nicely; "numbers" (and their generalizations) represent strategies in those games. So in the remainder of the book Conway spells this stuff out and revolutionizes the subject of game theory while he's at it.

Well, there must be maybe two or three people in the world to whom this all sounds very cool and yet who haven't already heard of this book. To you I say: read it before you die, and see how God created math.

5-0 out of 5 stars A very dense collection of original ideas
We all think we know numbers, and yet every once in awhile something comes along that makes us realize that we actually know very little. I am not talking about facts such as whether a specific large number is prime, but about the fundamental definition of what a number is. The appearance of the surreal numbers is one of those mathematical equivalents of a whack on the side of the head. Suddenly, numbers are defined as the strengths of positions in certain games, something that is at first strange, but it turns out that the class of objects defined this way includes the real and ordinal numbers. It certainly is different, and I had to read the first thirty pages of the book three times before I felt that I truly grasped the concepts behind the definition of the surreal numbers.
From that things move more smoothly. As I read through the book, it was easy to get the impression that most of life can be described as a game, where our day-to-day status in the community can be described as a dynamic set of surreal numbers. I often wondered if that may be an effective approach for artificial intelligence work, as it certainly seems that surreal numbers can be used to model almost any dynamic situation. Furthermore, effective game playing is nothing more than effective decision making.
There are many significant ideas in the book, at times you stop and start mentally jumping through different scenarios, as in "What would be the change if this rule is added, dropped or altered?" It seems that if you took that approach, several lifetimes could be spent in exploring all the possibilities. I have read many books and this one is most likely the densest carrier of new ideas that I have ever encountered.

... Read more

Isbn: 1568811276
Sales Rank: 100362
Subjects:  1. Game Theory    2. Mathematics    3. Number theory    4. Science/Mathematics   


$39.00

Hex Strategy: Making the Right Connections
by Cameron Browne
Average Customer Review: 4.0 out of 5 stars
Paperback (30 May, 2000)
list price: $38.50 -- our price: $38.50
(price subject to change: see help)
US | Canada | United Kingdom | Germany | France
Reviews (3)

4-0 out of 5 stars A Minute to Learn: A Lifetime to Master
Hex is a deterministic, zero-sum, abstract board game. If you know what this means, and appreciate such games, then you will find the game irresistible. The rules are so simple that you can "see" far down the strategy tree. Draws are impossible. Hex was invented independently by two eminent mathematicians, Piet Hein and Nobel Prize winner John Nash (the latter of _A Beautiful Mind_ fame). The feel of competition that this game provides is intense; one player compared it to a "knife fight in a phone booth." The game demands your best efforts, and rewards them.
If you are talented mathematically, there are chapters which deal with the game in a way that appeals. If not, you will still love to study how the book progresses from the simplest templates to tactics to overall strategy. Annotated games are given, as well as quizzes and problems. Game of expert play are taken from the internet. Hex programs are dicussed. There is a rich treatment of the variants and offshoots of the basic game, although perhaps basic 11 x 11 hex is probably still the best of the bunch. The author creates a rich vocabulary to describe the different aspects of the game, and while the reader may have to slow his reading occasionally and ponder, he will find everything in its proper order and will find that everything makes sense. I found a useful colection of blank boards of different sizes at the back of the book which I photocopied to make studies of the games I have now in progress on the net, and thereby explore the different possible avenues of play by using pencil-and-paper diagrams. Anyone who enjoys abstract games such as chess and go will be cheating himself by not exploring the richness of this book, and the richness and challenge of this game. There are a few typos here and there, but relatively few, and not very distracting.

4-0 out of 5 stars The "Hex" Bible
Being hex rules so simple, there are only 2 possibilities. Either you never heard about hex or you know how to play it. In the first case there are good odds that you can like this book,especially if you like games such as chess or checkers. But in the second, this book is a must. There is everything about this wondeful game, from strategy to historic notes, from variants to computer-play and algorithms, from sample games to a great reference section.
So this is THE hex book.

4-0 out of 5 stars Strategies for a simple game with many subtle possibilities
While I had heard of the game of Hex, until I read this book, it had been of little interest to me. My interest in games like this extends very little beyond the analysis of strategies. In most cases, I find detailedtreatments of tactics to be uninteresting and rarely complete an articlemuch less a book. However, this time I read it completely and not justbecause I needed to for the review. I am not sure whether it is the gameitself or the writers explanation, but my interest never waveredthroughout. While many of the questions regarding the best next move hadclear solutions, there were times when I did not believe that the givenmove was the appropriate one. However, once I read the explanation, therewas no doubt.
It is this feature that most likely kept my interest.Some of the strategies are obvious and easily seen. The point where myinterest was really generated was when the subtlety of play began to becomeevident. Seemingly foolish moves are suddenly understood to be brilliantones that force the conclusion. It is easy to prove that every game musthave a winner and also that there must be an optimal strategy that willguarantee victory.The problem of course is that the next best move thatguarantees victory often appears as one of little consequence.
Thisis the first book about games that I have read from cover to cover in manyyears where my interest never wavered. I tackled most of the problems andcame away with a deep appreciation for the game and the difficulty of play.It is strongly recommended.

Published in Journal of RecreationalMathematics, reprinted with permission. ... Read more

Isbn: 1568811179
Sales Rank: 477741
Subjects:  1. Board    2. Game Theory    3. Games    4. Games / Gamebooks / Crosswords    5. Games/Puzzles    6. Hex (Game)    7. Logic & Brain Teasers    8. Recreations & Games   


$38.50

Digital Typography (Center for the Study of Language and Information - Lecture Notes)
by Donald E. Knuth
Average Customer Review: 5.0 out of 5 stars
Paperback (01 June, 1998)
list price: $40.95 -- our price: $35.13
(price subject to change: see help)
US | Canada | United Kingdom | Germany | France
Reviews (5)

5-0 out of 5 stars Fascinating Background Material to Knuth's Typesetting Work
This book won't teach you TeX or Metafont. It might not even teach you all that much about particular algorithms (although Chapter 3 is one of the most detailed explanations of TeX's linebreaking algorithms published anywhere). Instead, this book offers a look behind the scenes.

Instead of beholding TeX and Metafont in their almost final versions, as published in _TeX: The Program_ and _Metafont: The Program_, respectively, you see them grow from the first design studies (when Knuth thought of TeX as a program for two grad students to write over a summer) to where they are today. You see how the collaboration between Knuth and Zapf on the Euler fonts worked, and you get another glance at many facets of Knuth's mind (And a beautiful mind it is indeed, even though it is entirely sane).

If you have any deeper interest in TeX and Metafont, this book is well worth the money.

5-0 out of 5 stars MASTERFUL
EXCELLENT book.... I cannot rate this one high enough.... at firstI thought it might have been expensive but it is NOT... the price is well WORTH it for what you get, Knuth is a master!

5-0 out of 5 stars The Art of Beautiful Print
This is a highly stimulating collection of essays about TeX, typography, the delectable art of programming, the joy of a beautifully constructed letter A, the world, the universe and everything. Knuth's style is, asalways, eminently readable and possessed of a fluidity unmatched intechnical writing this century.Definitely recommended. ... Read more

Isbn: 1575860104
Sales Rank: 272228
Subjects:  1. Art & Art Instruction    2. Computer Books: Languages    3. Computer fonts    4. Computerized typesetting    5. Computers    6. Data processing    7. Printing    8. Reference - General    9. TeX (Computer file)    10. Typography    11. Computers / Reference    12. Desktop publishing software    13. Electronic publishing: techniques   


$35.13

Selected Papers on Computer Science (Csli Lecture Notes)
by Donald E. Knuth
Average Customer Review: 5.0 out of 5 stars
Hardcover (13 July, 1996)
list price: $80.00
US | Canada | United Kingdom | Germany | France

Editorial Review

Knuth is, of course, one of the foremost computer scientists and has been instrumental in the invention of methods for translating and defining programming languages and mathematical analyses of algorithms. It is fair to say that computing as we know it today would not be possible without Knuth's contributions. This is a collection of his less technical publications dealing with the relationship of computer science and mathematics, CS education, and the history of computational techniques from Babylonia to the present including an analysis of John von Neumann's first program. Highly recommended to all serious computer scientists. ... Read more

Reviews (6)

5-0 out of 5 stars A fine book on the philosophy of computer science
Chapter Table of Contents:

0. Algorithms, Programs, and CS
1. CS and its Relation to Math
2. Math and CS: Coping with Finiteness
3. Algorithms
4. Algorithms in Modern Math and CS
5. Algorithms Themes
6.-9. Theory and Practice I..IV
10. Are Toy Problems Useful?
11. Ancient Babylonian Algorithms
12. Von Neumann's First Computer Program (sorting)
13. The IBM 650: An Appreciation from the Field
14. George Forsythe and the Development of Computer Science
15. Artistic Programming

Audence:
1) Computer Science faculty and graduate students.
2) Mathematicians.
3) other scientists who want to understand their computer science colleagues.

Knuth is best known for his huge corpus
The Art of Computer Programming [TAOCP] (at this time vols. I-III)
This text (Selected Papers) really isn't for beginning programmers
(TAOCP is better for this even if more dense).
"Selected" is not a How-to book.
It's the Philosophy of the PhD on the computing field.

Math:
Yes.Selected Papers has a fair amount of algebra.
The level of math required to understand and appreciate the book:
for several of the papers, the reader needs an understanding of combinatorics:
'n!' as factorial (not exclamination point), running sums,
matrix algebra, and a bit of calculus.Other papers have practically no math (the last 3 and the opening chapter[0]).
Heavy emphasis appears on the concept of the iterative nature of Algorithms
(in contrast to other sciences which seek closed form solutions).
Can you read it w/o the math?Sure, but you would be losing major points (read it with a knowledgeable friend).

The Reading:
I really liked the paper on Toy problems.I needed this earlier in my career.Many computer scientists who like fun but get criticism will like this essay.It alone is worth the price of the book.

The easy reading introductory parts of various papers are readable withminimum math and have valuable insights (like Knuth's informal observation that 2% of the general populice feels comfortable thinking algorithmically).

The early chapters on algorithms show the importance of experimental randomization methods.

The astute review reader will notice 4 chapters (really
4 speeches) on the ideas of Theory and Practice.A lot of this material is redundant, but it conforms to the ideas of stepwise refinement and it shows some of the development of DEK's thinking.Note: he describes; he does not offer solutions.

Knuth has an obscure challenge during DEK's address to IFIP (T&P IV), slide 33.I worked toward this without knowing it.

I'll be honest with the review reader:I know the author, and
he asked me to promote this book.And it's a book well worth promoting.

The book is a pleasure to those interested in the field.
Chap 4: I sat in the audience for this presentation.
Every library should have a copy for inspection if not enough to have on every computer scientist's book shelf (next to TAOCP, and other books by Don)., and it can be a good gift book to scientists.

5-0 out of 5 stars It changes the way you think about Computer Science
If this book is your first Donald Knuth's Book, the way you think about Computer Science will change. The author gives us the opportunity to think about Computer Science and Algorithms like a brillant scientist.

If you are a student you must read this book... and if you are not, I hope you already have it !

5-0 out of 5 stars Read this book first
Knuth's most famous work, the "Art of Computer Programming" series, is justly famed.Bill Gates said something like "If you can read it all the way through, write me and I'll hire you".But mostpeople can't make it through -- they're put off by the use of assemblylanguage, or by the amount of mathematics.I have to agree that the use ofassembly throughout is overkill, and I always wished there was some way toget the essence and excitement of "Art of Computer Programming"without the full tedium. Now there is.

"Selected Papers inComputer Science" succeeds beautifully in showing what its like to bea computer scientist, and how that is related to but different from being amathematician.At the heart of the book are four essays on "Theoryand Practice".Actually, it should be "Practice andTheory", because the only sensible way to progress in any field is toget some practical experience first, and then acquire the theory necessaryto understand what you did, and to allow you to do more.Knuth covers thisvery well for computer science.I am in the habit of dog-earing pages in abook that offer an especially important insight.Looking back at my copyof "Selected Papers", I see that about 40 pages are so marked; anamazingly high ratio for a book of 270 pages.Try a test: read 10 pagesfrom the book at random, if you don't find at least one important insight,then probably this book (and perhaps computer science in general) is notfor you.If you do, you can be assured that the full book will give youmany more. ... Read more

Isbn: 1881526925
Subjects:  1. Computer Bks - General Information    2. Computer Science    3. Computer Science (General)    4. Computers    5. Reference - General    6. Science/Mathematics    7. Computers / General    8. General Theory of Computing   


Selected Papers on the Analysis of Algorithms
by Donald E. Knuth
Average Customer Review: 4.5 out of 5 stars
Paperback (June, 2000)
list price: $28.95 -- our price: $28.95
(price subject to change: see help)
US | Canada | United Kingdom | Germany | France
Reviews (5)

5-0 out of 5 stars Knuth is Analysis of Algorithms
Befor Donald Ervin Knuth, there was no such thing as the Analysis of Algorithms.He is a visionary in this field, and these selected papers are a testomony to his greatness in this field.

3-0 out of 5 stars Not as Approachable as Knuth's Other Writings
To a reader interested in the analysis of algorithms, this bookdoubtlessly contains a number of very thorough analyses, with someinteresting correspondence about the origin of complexity O()-notation andthe term "NP-hard" thrown in.

As a reader more interested inKnuth's work in general, I must admit that, despite having advanced degreesin CS and a quite decent math education, I found myself unable to followthe heavy mathematics employed, and ultimately, the problems analyzed werenot interesting enough to me to make me spend the effort to follow it. Oneof the chapters was titled "A Trivial Algorithm Whose AnalysisIsn't", and this probably sums up why I'm not entirely enthusiasticabout this book and about the field of algorithm analysis ingeneral.

Knuth wouldn't be Knuth if he didn't throw some lighter materialin as well, and chapter 2, "The Dangers of Computer ScienceTheory", was quite amusing.

5-0 out of 5 stars Knuth++
Professor Knuth collects a charming and valuable set of papers into one terrific place.Don't miss his satirical "anti- Science" article "The Dangers of Computer Science", Chapter two, first presentedin 1971. ... Read more

Isbn: 1575862123
Sales Rank: 589237
Subjects:  1. Algorithms    2. Discrete Mathematics    3. General    4. Logic    5. Logic Design    6. Mathematics    7. Programming - General    8. Science/Mathematics    9. Algorithms & procedures    10. Medical / General   


$28.95

Concrete Mathematics: A Foundation for Computer Science (2nd Edition)
by Ronald L. Graham, Donald E. Knuth, Oren Patashnik
Average Customer Review: 4.0 out of 5 stars
Hardcover (28 February, 1994)
list price: $64.99 -- our price: $51.45
(price subject to change: see help)
US | Canada | United Kingdom | Germany | France
Reviews (24)

3-0 out of 5 stars A pourry of combinatorics
I want to start saying that this is a book designed for Engineers, not for Mathematicians. It focuses on the tecniques, not on the arguments. This is not a book about combinatorics, it is a wide raging introduction (it lacks on definitions, and his proofs are a lot far away from mathematical ones). The Enegineers can use this book as a good reference. The Mathematicians can improve their lateral thinking, for them (well: us) it is book about problem-solving strategies.
I will never use this book as a textbook for a graduate/undergraduate course, it can be helpful if used with another book about combinatorics: when you study a combinatorial object, you can read from this book the techniques it involves.
The exercises are extremely exciting, when I read this book I spent a lot of time about its exercises (proportion read:solve = 1:3), and they led me to interesting results.

4-0 out of 5 stars Steep learning curve, the definitive prerequisite for TAOCP.
Why I got this book:
It's a great feeling to know how computers work, when I decided that I want to make a career and a life out of computers, as its truly a passion for me, I delved deeper, discovering the true beauty in the Science part of Computer Science, so I decided to get Donald Knuth' "The Art of Computer Programming" - to describe that seminal, huge work, it's like biting more than you can chew while trying to drink from a fire hose, moreover, the technical and mathematical prerequisites for the work are sometimes too demanding, they require a huge amount of experience with discrete mathematics, although I had some lectures and read some books, none came close "Concrete Mathematics", it covers, from ground up (though with a dangerously steep learning curve) a lot of discrete mathematics topics, it is by far the most extensive work I've read about Sums and really teaches the algorithmic problem solving thinking skill the authors preach so much about, with small amusing comments written by actual students of this course, a comfortable format, and very good writing skills, you can feel these guys are great professors who enjoy this material and are passionate about teaching it.

Recommended, though some better, less steep, introductionary text books are probably out there.

Enjoy.

3-0 out of 5 stars Only one problem with this textbook
Basically, I like this textbook. The material is interesting, the way the authors presented the material is inspiring, and they provided a lot of jokes to make even studying for exams not that boring. But there is one big problem which made me decided to rate this book only 3 stars instead of 5 stars: the authors like to use non-standard notations. For example: m\n means "m>0 and n=mk for some integer k". One of the worst thing in scientific world is writing things others cannot read, and the authors did this by introducing many strange notations. These things makes the good work sometimes almost unreadable. This is not computer systems in which we use "cp" for the copy command and "cd" for change directory command.

What a pity the authors did that. This textbook will be perfect without those strange notations.... ... Read more

Isbn: 0201558025
Sales Rank: 77594
Subjects:  1. Computer Bks - Languages / Programming    2. Computer Science    3. General    4. Mathematics    5. Programming Languages - General   


$51.45

1-6 of 6       1
Prices listed on this site are subject to change without notice.
Questions on ordering or shipping? click here for help.

Top 

 
Books - Science - Evolution - Game Theory - Books for a computer programmer/engineer.   (images)

Images - 1-6 of 6       1
Click image to see details about the item
Images - 1-6 of 6       1