Milestones in Computer Science and Information Technology
Greenwood Press, 2003 - 380 oldal
Using the same approach as the popular "Milestones in Science and Technology" and "Milestones in Health and Medicine," this unique reference features more than 600 concise entries describing the most significant advances in the field of computer science and information technology. Arranged in a convenient A-to-Z format, entries explain topics in a wide variety of categories, including hardware, software, theory, mathematics, programming, languages, memory, architecture, applications, and graphics.
Each entry presents a history of the topic's milestones, describes its current status, and recommends a source for additional research. Entries link key developments and discoveries to notable researchers and companies, from the famous figures like Alan Turing and Bill Gates to lesser-known names like Gordon Moore and Zuse. More than 30 illustrations, helpful cross-references, four indexes, and selected sources for additional reading help users navigate this reference and supplement their research. Whether you're researching cutting-edge technologies such as MP3, data encryption, and Beowulf clusters, or historical topics like Fortran, Packard Bell, and the Alto computer, students from high school and college, scholars, and the general public can easily find the facts and dates surrounding the most significant developments in the history of computing.
1 - 3 találat összesen 42 találatból.
Automatic theorem proving did in conjunction with the BESM computer. But in this
sense, ... The earliest theorem proving program, the 1957 Logic Theorist of Allen
Newell, Herbert Simon, and Cliff Shaw, proved theorems in Boolean algebra.
On rare occasions, a mathematician is able to prove a theorem for all but a finite
number of special cases, a number too ... Mathematicians believed, but had not
proved, that use of two overlapping spherical bubbles of equal radii would be ...
The implication became significant to computer science when Alan Turing proved
an equivalent corollary, namely, that the Halting problem is undecidable.
Additional reading: Casti, The Cambridge Quintet. GOLEM computers. See
Mit mondanak mások - Írjon ismertetőt
Milestones in Computer Science and Information TechnologyFelhasználói ismertető - Not Available - Book Verdict
In the preface of his latest endeavor, which sits somewhere between an encyclopedia and a dictionary, Reilly (computer science, emeritus, SUNY at Buffalo; Encyclopedia of Computer Science) states that ... Teljes értékelés elolvasása
Listing of Cited References
Classification of Articles
1 további fejezet nem látható