Bosques Curiosos Y Pajaros Aristocraticos. Juegos Para Imitar a Una Pajaro Imitador

The famous Inspector Craig goes on new and unusual adventures to learn more about the secrets of combinatorial logic: I must confess that the subject intrigues me enormously. But I would like to know how, when and why it originated. Today, it has important applications in computing and artificial intelligence, but the earliest research dates back to the early 1920s. These include the pioneering studies of Shönfinkel, Curry, Fitch, Church, Kleene, Rosser and Turing. Solve the puzzles of Inspector Craig, logician Fergusson and Professor Griffin and you will understand how it is possible to write computer programs in combinatorial terms. There is a biunivocal correspondence between the birds in Griffin's forest and all computer programs, such that, if bird x corresponds to program X and bird y corresponds to program Y, then bird xy will correspond to program XY. Surely, this is what Professor Griffin meant when he said that, given any computer program, it can be matched to some bird in the forest.