How Singular? How singular is the Singularity? Will it happen in an instant? Lets consider again the derivation of the word. In mathematics a singularity is a value that is beyond any limit - in essence, infinity. The Singularity as we have discussed it in this book, does not achieve infinite levels of computation, memory, as any other other measurable attribute. But it certainly achieves vast levels of all these qualities, including intelligence. With the reverse engineering of the human brain we will be able to apply the parallel, self-organizing, chaotic, algorithms of human intelligence to enormously powerful computational substrates. This intelligence will then be in a position to improve its own design, both hardware and software, in a rapidly accelerating iterative process.

Most programmers' fear of user interface (UI) programming comes from their fear of doing UI design. They think that UI design is like graphic design—the mysterious process by which creative, latte-drinking, all-black-wearing people produce cool-looking, artistic pieces. Most programmers see themselves as analytic, logical thinkers instead—strong at reasoning, weak on artistic judgment, and incapable of doing UI design. In this brilliantly readable book, author Joel Spolsky proposes simple, logical rules that can be applied without any artistic talent to improve any user interface, from traditional GUI applications to websites to consumer electronics. Spolsky's primary axiom, the importance of bringing the program model in line with the user model, is both rational and simple. In a fun and entertaining way, Spolky makes user interface design easy for programmers to grasp. After reading User Interface Design for Programmers , you'll know how to design interfaces with the user in mind. You'll learn the important principles that underlie all good UI design, and you'll learn how to perform usability testing that works.

Book by Stallman, Richard M., McGrath, Roland

Textbook designed for an introductory undergraduate course in programming using the language Scheme, a small language analogous to a Swiss army knife in its handiness and versatility for small tasks. Annotation copyright Book News, Inc. Portland, Or.

An introduction to computers giving a brief history of the machines in addition to the author's personal experiences while learning to work with them

Numerical linear algebra, digital signal processing, and parallel algorithms are three disciplines with a great deal of activity in the last few years. The interaction between them has been growing to a level that merits an Advanced Study Institute dedicated to the three areas together. This volume gives an account of the main results in this interdisciplinary field. The following topics emerged as major themes of the - Singular value and eigenvalue decompositions, including applications, - Toeplitz matrices, including special algorithms and architectures, - Recursive least squares in linear algebra, digital signal processing and control, - Updating and downdating techniques in linear algebra and signal processing, - Stability and sensitivity analysis of special recursive least squares problems, - Special architectures for linear algebra and signal processing. This book contains tutorials on these topics given by leading scientists in each of the three areas. A consider- able number of new research results are presented in contributed papers. The tutorials and papers will be of value to anyone interested in the three disciplines.

* Will appeal to the same (large) audience as Joel on Software * Contains exclusive commentary by Joel * Lots of free publicity both because of Joel’s influence in the community and the influence of the contributors

The starting point of this volume was a conference entitled "Progress in Mathematical Programming," held at the Asilomar Conference Center in Pacific Grove, California, March 1-4, 1987. The main topic of the conference was developments in the theory and practice of linear programming since Karmarkar's algorithm. There were thirty presentations and approximately fifty people attended. Presentations included new algorithms, new analyses of algorithms, reports on computational experience, and some other topics related to the practice of mathematical programming. Interestingly, most of the progress reported at the conference was on the theoretical side. Several new polynomial algorithms for linear program- ming were presented (Barnes-Chopra-Jensen, Goldfarb-Mehrotra, Gonzaga, Kojima-Mizuno-Yoshise, Renegar, Todd, Vaidya, and Ye). Other algorithms presented were by Betke-Gritzmann, Blum, Gill-Murray-Saunders-Wright, Nazareth, Vial, and Zikan-Cottle. Efforts in the theoretical analysis of algo- rithms were also reported (Anstreicher, Bayer-Lagarias, Imai, Lagarias, Megiddo-Shub, Lagarias, Smale, and Vanderbei). Computational experiences were reported by Lustig, Tomlin, Todd, Tone, Ye, and Zikan-Cottle. Of special interest, although not in the main direction discussed at the conference, was the report by Rinaldi on the practical solution of some large traveling salesman problems. At the time of the conference, it was still not clear whether the new algorithms developed since Karmarkar's algorithm would replace the simplex method in practice. Alan Hoffman presented results on conditions under which linear programming problems can be solved by greedy algorithms.