Tag: recursion
I didn’t read much last month, but I got an email this morning from someone who mentioned that I’d like Greg Egan’s Permutation City. I read it in April when I was in Japan on my Q219 Vacation with Amy but never really blogged much about it.
When I got the email today, I thought of two novels that I’ve read this year that are in the same vein. They are Blake Crouch’s book Recursion and Neal Stephenson’s book Fall; or, Dodge in Hell.
All three of these books are outstanding. They are all near term science fiction, with extraordinary world-building dynamics, and complex time narratives.
While Neal Stephenson is possibly the best world builder in the entire fiction genre today, both Blake Crouch and Greg Egan are in the same category. Some people find Stephenson’s world-building overwhelming, but as a fast reader, I’ve learned how to skim through parts while absorbing the essence of what is going on. Interestingly, this technique isn’t required for Crouch but occasionally is needed with Egan.
All three books incorporate the concept of recursion in very foundation ways. Everyone studying computer science learns the magic of recursion very early on, often through the factorial example, listed below for fans of Scheme, just to bring back memories of 6.001.
(define (factorial x)
(if (= x 0)
1
(* x (factorial (- x 1)))))
While Crouch hits you over the head with it in the beginning, Egan spends about 100 pages getting you ready for it. Stephenson probably takes about 200 pages before you start getting a feel for it. But, by the last quarter of each book, you are deep, deep, deep, deep, …
I thought each book ended extremely well. For all three, I found myself staying up late reading, which is always a sign the book has grabbed me since my bedtime since I was ten has been 10 pm.
While summer reading time is almost over, you’ve still got a few weeks for one of these if you want to explore the literary equivalent of a Sierpiński triangle.