 |
|
|
|
|
 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... |  |  Macs For Dummies
What an amazing time to get to know the Mac. For years these elegantly
designed computers have been a model of simplicity and virus-free
stability. But that’s never stopped Apple from making these machines even
harder to resist by applying stunning changes.
Consider Apple’s seismic embrace of Intel a few years... |  |  Software Build Systems: Principles and Experience
Are you a software developer? Are you interested in how build systems work?
You’re reading this book; so there’s a good chance you answered “Yes” to both
questions. On the other hand, many software developers aren’t interested in
how their program is compiled. Most people just want to press a button and... |
|
Result Page: 73 72 71 70 69 68 67 66 65 64 |