• Hector Zenil's profile

    Boston

    • What I do

      Hector Zenil graduated with a BS in math from the National University of Mexico (UNAM) and with a master’s degree in logic (LoPhiSS) from the University of Paris I (Pantheon-Sorbonne). Currently he is a graduate student at Lille 1 University working toward a PhD in Computer Science and from Paris 1 University toward a PhD in Philosophy, both on algorithmic complexity and randomness. He was a 2005 NKS Summer School alumni at Brown University. He joined Wolfram Reserch, Inc. as an R&D fellow in Boston in 2006 working on projects related with mathematical logic, automatic theorem proving and linguistic discoveries.

    • Affiliations

      Current

    • Interests

      I am interested in the exploration and study of the computational universe of simple programs and rewriting systems such as Turing machines, cellular automata and tag systems. Foundations of Math and Computer Science, in particular axiom systems, the Church-Turing thesis, alternative models of computation, algorithmic complexity and randomness. As well as the physical basis of computation and computation in physics.

    • Projects

      -Experimental algorithmic information theory (algorithmic complexity)
      -Enumerating, generating and studying the mathematical universe of first order axiom systems
      -Alternative models of computation
      -The Church-Turing thesis
      -The principle of irreducibility and computational equivalence and the Fredkin-Zuse thesis.
      -Universality and computation
      -The simulation hypothesis
      -The physical basis of computation and the computation of physics
      -Randomness and algorithmic complexity

    • Publications

      view all
Sign in

New to Nature Network?
Sign up today!

Search people
Send an invite

Advertisement