Anonymous user
Books: Difference between revisions
Jump to navigation
Jump to search
no edit summary
| [unchecked revision] | [unchecked revision] |
No edit summary |
No edit summary |
||
Line 301:
|review=}}
{{Book|ISBN=0201835959|ASIN=0201835959
|title=The Mythical Man-Month: Essays on Software Engineering, 20th Anniversary Edition
|author=Frederick P. Brooks, Jr.
Line 312:
== Practice ==
{{Book|ISBN=
|title=Learning the vi and Vim Editors
|author=Arnold Robbins, Elbert Hannah, and Linda Lamb
Line 355:
Robert Mecklenburg, author of the third edition, has used ''make'' for decades with a variety of platforms and languages. In this book he zealously lays forth how to get your builds to be as efficient as possible, reduce maintenance, avoid errors, and thoroughly understand what make is doing. Chapters on C++ and Java provide makefile entries optimized for projects in those languages. The author even includes a discussion of the makefile used to build the book.
|review=}}
= Theory of Computation =
{{Book|ISBN=113318779X|ASIN=113318779X
|title=Introduction to the Theory of Computation, 3rd ed.
|author=Michael Sipser
|supp=
|description=
|review=}}
{{Book|ISBN=0716782669|ASIN=0716782669
|title=The Language of Machines: An Introduction to Computability and Formal Languages
|author=Robert W Floyd, and Richard Beigel
|supp=[http://web.archive.org/web/20100117200711/http://knight.cis.temple.edu/~beigel/long.html#lom Link]
|description=In ''The Language of Machines'', Robert Floyd and Richard Beigel revolutionize the teaching of computability and languages. They propose nothing less than redefinition of the building blocks of automata theory: their unified model of computation clarifies the subject as never before. Floyd and Beigel's single model encompasses all the traditional types of computing machines and even "real world" electronic computers.
Using an approach that has been successfully class tested at Stanford, Yale, and Johns Hopkins, Floyd and Beigel offer valuable innovations:
* '''Unified definitions''' that yield insight into the capabilities of a wide variety of machines
* '''The perfect combination of simplicity and rigor'''---their new approach makes formerly obscure results accessible.
* '''Ideas and examples from practical computer science''' bring theory to life
* '''A mechanism to combine programs,''' akin to pipes in UNIX(tm)
* '''The first formal definition of simulation''' that permits modularized proofs
* '''A general system of standardization of programs,''' which streamlines proofs
Floyd an Beigel's bold reformulation of computability and formal language theory provides a firm foundation on which students can build a rich and enduring body of knowledge.
|review=}}
| |||