




Coders at WorkPeter Seibel interviews 15 of the most interesting computer programmers alive today in Coders at Work, offering a brandnew companion volume to Apress’s highly acclaimed bestseller Founders at Work by Jessica Livingston. As the words “at work” suggest, Peter Seibel focuses on how his...   Computability Theory: An Introduction to Recursion Theory
The study of the class of computable partial functions (i.e., recursive partial functions)
stands at the intersection of three fields: mathematics, theoretical computer science,
and philosophy.
Mathematically, computability theory originates from the concept of an algorithm.
It leads to a classification of functions according...   Semantic Techniques in Quantum Computation
The idea of quantum computation, in the algorithmic sense, originated from the suggestion by Feynman (1982) that a computer based on the principles of quantum mechanics might be capable of efficiently simulating quantum systems of interest to physicists; such simulation seems to be very difficult with classical computers. Feynman’s... 




Result Page: 6 5 4 3 2 1 