>>6
Why is my copy such a shitty scan with shitty OCR?
Name:
Anonymous2012-11-30 23:10
>>2
This. It's just a popular math/science book, it doesn't really go into rigorous details. It's a book for the masses.
Name:
Anonymous2012-11-30 23:10
>>7
I don't know. I'm from the XXth century and enjoyed the typography masterpiece on a paper-made book that I bought.
Name:
Anonymous2012-12-01 0:12
OP, Concrete Mathematics is a textbook, I thought of something more recreational and more on topic with Harry Potter, Escher, Bach (that you really don't have to read):
To Mock a Mockingbird and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic (1985, ISBN 0-19-280142-2) is a book by the mathematician and logician Raymond Smullyan. It contains many nontrivial recreational puzzles of the sort for which Smullyan is well-known. It is also a gentle and humorous introduction to combinatory logic and the associated metamathematics, built on an elaborate ornithological metaphor.
Combinatory logic, functionally equivalent to the lambda calculus, is a branch of symbolic logic having the expressive power of set theory, and with deep connections to questions of computability and provability. Smullyan's exposition takes the form of an imaginary account of two men going into a forest and discussing the unusual "birds" (combinators) they find there (bird watching was a hobby of the inventor of combinatory logic, Haskell Curry). Each species of bird in Smullyan's forest stands for a particular kind of combinator appearing in the conventional treatment of combinatory logic. Each bird has a distinctive call, which it emits when it hears the call of another bird. Hence an initial call by certain "birds" gives rise to a cascading sequence of calls by a succession of birds.
Deep inside the forest dwells the Mockingbird, which imitates other birds hearing themselves. The resulting cascade of calls and responses analogizes to abstract models of computing. With this analogy in hand, one can explore advanced topics in the mathematical theory of computability, such as Church-Turing Computability and Gödel's Theorem.
>>11
No, but it's the kind of book you'll find for $4 on Amazon or Abebooks.
There's a really nice 124MB scan of it on diverse pirate sites, you can always read it on your desktop or do the OCR yourself.
Anyway, it's puzzles, so you're going to read one or two of them, think about it during the day when you're bored and read the solutions later.
>>16
So does PDF. Thank your browser developers like >>17 for making the shit, still look like shit. "Mom, so me a graph on the fly with this function! NOW!"
Name:
Anonymous2012-12-01 16:41
>LE LELLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
>LE MEME FACE WHEN
>LE MEME FACE WHEN
>LEEEEEEEEEEEEEEEEEEEEEEEEEEELLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
>EGIN!
>EGINGIN!!!!
>EGINGINGWIM!!!!!!!!!!!!!!!!!!!!!!!!
>MY LEL FACE WHEN LE /G/RO IS FUQIN EGIN
Name:
Anonymous2012-12-01 21:44
>>25
woah, that's deep. You take an take an ironic post of an ironic post and then use it ironically!