Search results
Results from the WOW.Com Content Network
This article is a list of notable unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known or when experts in the field disagree about proposed solutions.
Code: The Hidden Language of Computer Hardware and Software; Compilers: Principles, Techniques, and Tools; Computer Graphics: Principles and Practice; Computers and Intractability; Concepts, Techniques, and Models of Computer Programming; Concrete Mathematics
Computer science is the study of computation, information, and automation. [1] [2] [3] Computer science spans theoretical disciplines (such as algorithms, theory of computation, and information theory) to applied disciplines (including the design and implementation of hardware and software).
SICP has been influential in computer science education, and several later books have been inspired by its style. Structure and Interpretation of Classical Mechanics (SICM), another book that uses Scheme as an instructional element, by Gerald Jay Sussman and Jack Wisdom; Software Design for Flexibility, by Chris Hanson and Gerald Jay Sussman
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem is a task solved by a computer.
The theory of computation can be considered the creation of models of all kinds in the field of computer science. Therefore, mathematics and logic are used. In the last century, it separated from mathematics and became an independent academic discipline with its own conferences such as FOCS in 1960 and STOC in 1969, and its own awards such as the IMU Abacus Medal (established in 1981 as the ...
Donald Knuth - The Art of Computer Programming; Ellen Ullman - Close to the Machine; Ellis Horowitz - Fundamentals of Computer Algorithms; Eric Raymond - The Art of Unix Programming; Gerald M. Weinberg - The Psychology of Computer Programming; James Gosling - The Java Programming Language; Joel Spolsky - The Best Software Writing I
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.