He Is, somewhat, 'freakish'-looking; I'll concede, that. -

I'm too exhausted to say much about this, other than I read that book. There was some result about random graphs that was picked up on by complexity theorists. I think it was regarding the probability of a connected component --> 1 given certain growth of nodes and connectivity with number of nodes. some existence proof. These were very important to some stuart kaufmann's complexity theory arguments - if you read 'at home in the universe' you'll know what i mean.
 
Anyhow, apparently he called young children 'epsilons'....the rest is wiki lore....