## Out of their Minds: The Lives and Discoveries of 15 Great Computer ScientistsImagine living during the Renaissance and being able to interview that era's greatest scientists about their inspirations, discoveries, and personal interests. The latter half of our century has seen its own Renaissance--informations technology has changed irrevocable the way we live, work, and think about the world. We are fortunate, therefore, that the authors of Out of Their Minds have been able to talk so candidly with the founders of computer science.... |

### What people are saying - Write a review

#### Review: Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists

User Review - Tommy /|\ - GoodreadsA little heavy on mathematical theory and concepts for my taste - but its an excellent overview of some of the early giants in the history of the computing field. Read full review

### Contents

Linguists HOW TO TALK TO MACHINES | xi |

RESTLESS INVENTOR | 3 |

THE UNCOMMON LOGICIAN OF COMMON SENSE | 19 |

A CLEAR ROMANTIC VISION | 36 |

ALGORITHMISTS HOW TO SOLVE PROBLEMS FAST | 49 |

APPALLING PROSE AND THE SHORTEST PATH | 53 |

THE POSSIBILITIES OF CHANCE | 66 |

BOUNDLESS INTERESTS A COMMON THREAD | 87 |

RACING WITH THE SPEED OF LIGHT | 171 |

THE BIOLOGICAL CONNECTION | 184 |

SCULPTORS OF MACHINE INTELLIGENCE HOW TO MAKE MACHINES SMART | 201 |

THE POWER OF KNOWLEDGE | 205 |

A TWENTYYEAR BET | 219 |

SECRETS OF SUCCESS? | 239 |

THE NEXT 25 YEARS | 245 |

Glossary | 249 |

IN SEARCH OF GOOD STRUCTURE | 100 |

OF TIME SPACE AND COMPUTATION | 118 |

A GOOD SOLUTION IS HARD TO FIND | 137 |

ARCHITECTS HOW TO BUILD BETTER MACHINES | 153 |

A DELIGHT IN MAKING THINGS WORK | 157 |

References | 265 |

275 | |

277 | |

### Other editions - View all

### Common terms and phrases

algorithm applied artificial Backus Brooks build calculation called communication complete computer science Connection Cook data structure decided developed Dijkstra Donald Knuth early edges Edsger Dijkstra engineering example expert fact field Figure finite Fortran function given graph idea instructions intelligence interested invented John knowledge known Knuth Lamport language later Lenat letter logic look machine mathematician mathematics McCarthy means memory messages method move never operations parallel person physics possible problem processing processor proofs prove question Rabin reasoning represent require rules scientists sequence showed solution solve started structure Tarjan task theory things thought tion Turing turned University write

### References to this book

Complexity Theory: Exploring the Limits of Efficient Algorithms Ingo Wegener No preview available - 2005 |