Enrique Zeleny is a physicist from the Autonomous University of Puebla with a master’s degree in quantum cosmology. He attended the NKS Summer School 2005, with a project about causal networks generated by Turing machines. He researched recursive sequences and Turing machines and prepared artwork for the NKS conferences in 2006 and 2007. Currently, he contributes actively to the Wolfram Demonstrations Project, with nearly a hundred Demonstrations in a variety of subjects from designs for neckties and stalactite formation to chaos in black holes, including some research in NKS systems.
Project: Complexity in the Mathematica Language
The goal is to find complex behavior with Partition, RotateLeft, and Join, and with other combinations of Mathematica primitives, that alone only do simple tasks but combined can do weird things. Another idea is this: given a set of inputs and outputs, which kinds of minimal programs can produce the outputs from the inputs? And which programs yield equivalent structures or compute the same functions or can be reduced or emulated? Which of them are more powerful?. Visualizing the evolution of trees (representing the expressions) in the evaluation process can be a useful tool. This lead us to explore strange corners of the Mathematica programming language.
Favorite Radius 3/2 Rule
Rule 44153 shows three different kinds of behavior simultaneously.