Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Zenil, Hector
Oxford Immune Algorithmics
Oxford, United Kingdom
 
   Featured Reviewer
   Reader Recommended
   Reviewer Selected
Follow this Reviewer
 
 
 

Hector Zenil received his bachelor’s degree in math from the National University of Mexico (UNAM), his master's degree in logic from the Sorbonne in Paris, and his PhD in computer science from the University of Lille 1, France (2011). After graduation, he did postdoctoral research at the Behavioural and Evolutionary Theory Lab of the University of Sheffield in the UK. He currently conducts research in information theory and computational biology at the Unit of Computational Medicine of the Karolinska Institute in Stockholm, working on cutting-edge applications of complexity science to genomics and network biology.

He is also the head of the Algorithmic Nature Group (the lab responsible for the Online Algorithmic Complexity Calculator and the Human Randomness Generation Project), co-director of the French-based lab LABORES For the Natural and Digital Sciences, and senior research associate and consultant for Wolfram Research (the creators of Mathematica).

He has held various visiting positions in the US. He was a visiting scholar in 2008 at Carnegie Mellon University and in 2007 at MIT, associated with the NASA Mars Gravity Biosatellite project. In 2012, he was invited to become a member of the Turing Centenary Advisory Committee in the UK and was accepted to Mexico's SNI (a distinguished list of appointed national researchers).

He is the editor of the books Randomness Through Computation (World Scientific), A Computable Universe (World Scientific, with a foreword by Sir Roger Penrose), and Irreducibility and Computational Equivalence (Springer, with a foreword by Greg Chaitin and an afterword by Cris Calude).

He has been a reviewer for Computing Reviews since 2003, and has written over 40 book and paper reviews.

 
 
Options:
Date Reviewed  
 
1
- 10 of 17 reviews

   
  Causal case study methods: foundations and guidelines for comparing, matching, and tracing
Beach D., Pedersen R., University of Michigan Press, Ann Arbor, MI, 2016. 398 pp.  Type: Book (978-0-472053-22-3)

The book is a treatise on some important aspects of causality from epistemological and ontological points of view, particularly chapters 1 through 5 on understanding, defining, and measuring causality. Except for chapters 4 and 5, chap...

Apr 1 2019  
   Turing’s vision: the birth of computer science
Bernhardt C., The MIT Press, Cambridge, MA, 2016. 208 pp.  Type: Book (978-0-262034-54-8)

Books about Alan Turing’s life and work have always gone to one of two extremes, either to the complete technical or to the complete trivial focusing on, for example, Turing’s sexual preferences, which should be com...

Sep 29 2016  
   Conformal prediction for reliable machine learning: theory, adaptations and applications
Balasubramanian V., Ho S., Vovk V., Morgan Kaufmann Publishers Inc., Waltham, MA, 2014. 334 pp.  Type: Book (978-0-123985-37-8)

Conformal prediction is based on a family of measures that are based on a combination of algorithmic information theory and machine learning techniques, providing a means for reliable estimation with consideration to confidence values ...

Dec 4 2014  
   Alan Turing: his work and impact
Cooper S., van Leeuwen J., Elsevier Science, Waltham, MA, 2013. 944 pp.  Type: Book (978-0-123869-80-7)

A volume of this caliber is difficult to review, not only because of its length but also because half of the contents are the collected works of one of the most prominent modern scientists, Alan Turing, whose birth centenary it commemo...

Sep 17 2013  
   Algorithmic randomness and complexity
Downey R., Hirschfeldt D., Springer-Verlag New York, Inc., Secaucus, NJ, 2010. 855 pp.  Type: Book (978-0-387955-67-4)

The study of the complexity of infinite random sequences, as illustrated by Martin-Löf’s work on algorithmic randomness, has turned out to be deeply connected to the field of relativized theory of computation degrees...

Oct 4 2011  
   Computability theory: an introduction to recursion theory
Enderton H., ACADEMIC PRESS, Boston, MA, 2010. 192 pp.  Type: Book (978-0-123849-58-8)

Computability is concerned with the question of what computers can do in principle. Since Enderton directly contributed to the very areas that this book covers (computability and computational complexity), he is able to provide a conci...

Jun 24 2011  
   A computer scientist’s guide to cell biology
Cohen W., Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 100 pp.  Type: Book (9780387482750), Reviews: (2 of 2)

This practical and short guide presents a treatment of the general concepts of modern biology, providing the computer scientist with the tools necessary to read and understand current literature in the field by using experimental proce...

Feb 6 2008  
  18 unconventional essays on the nature of mathematics
Hersh R., Springer-Verlag New York, Inc., Secaucus, NJ, 2005. 326 pp.  Type: Book (9780387257174)

When I found this book on the shelves of the Henri Poincaré Institute’s library, some months ago, I knew immediately that it was the kind of provocative book I would like to read and review....

Jan 23 2008  
  Emergence of a super-Turing computational potential in artificial living systems
Wiedermann J., van Leeuwen J.  Advances in artificial life (Proceedings of the 6th European Conference on Advances in Artificial Life (ECAL 2001),Sep 10-14, 2001) 55-65, 2001.  Type: Proceedings

The classical approach of computability theory is to consider models as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but c...

Jun 17 2005  
   Open source solutions for small business problems (Networking Series)
Locke J., Charles River Media, Inc., Rockland, MA, 2004.  Type: Book (9781584503200)

I recommend this book highly to anyone who is looking to the open source market to reduce costs without losing robustness and performance. Open source software presents easy and powerful solutions at a fraction of the cost, becoming a ...

Sep 30 2004  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy