Wolfram Computation Meets Knowledge

Wolfram Summer School


Carlos Martin

Summer School

Class of 2015


Carlos Martin is a student at the Columbia University School of Engineering and Applied Science. He intends to pursue a major in applied physics and applied mathematics with a minor in computer science. Carlos is a member of the Egleston Scholars Program, which recognizes exceptional undergraduate students from Columbia Engineering. The program provides students with research opportunities, enhanced advising, and faculty mentorship.

Last summer, Carlos worked at Canada’s National Laboratory for Particle and Nuclear Physics (TRIUMF), home to the world’s largest cyclotron. His work focused on laser ion sources and laser resonance ionization spectroscopy, a method for selectively generating radioactive ion beams used in particle and nuclear physics experiments. This summer he will be working at the Columbia Lightwave Research Laboratory and the Columbia Plasma Physics Laboratory. The Lightwave Research Lab investigates data capacity and routing in optical networks, which use light signals to transmit information. Carlos will be investigating optical computing architectures and developing the lab’s simulator. In the Plasma Physics Lab, which studies plasma instabilities and conducts controlled fusion energy experiments, he will be working on developing a mathematical model and computer simulation of an electron-positron plasma in a dipole field.

Carlos is deeply interested in fundamental physics research, particularly in the fields of cosmology and quantum gravity. He is also interested in exploring artificial general intelligence through reinforcement learning techniques and evolutionary algorithms. He has worked with artificial neural networks, discretization schemes for electromagnetism, Eulerian and Lagrangian methods for fluid dynamics, and rigid body dynamics using numerical integration.

He looks forward to participating in the Wolfram Science Summer School and applying Wolfram technology to his fields of interest.

Project: Functionals of Cellular Automaton Rules

We model the collection of possible neighborhood configurations in an elementary cellular automaton as a discrete manifold over which the transition function or rule takes on Boolean values. We find the Dirichlet energy of different rules through the Boolean differential calculus by summing over all possible neighborhood configurations. We also perform spectral analysis of different elementary cellular automaton rules using the Walsh\[Dash]Hadamard transform. The same analysis can be applied to transition functions that act on an entire causal network of cells, with cells in the first layer as the input and cells in the last layer as the output.


  • Yilmaz, O. (2014). Reservoir Computing using Cellular Automata. arXiv:1410.0162 [cs.NE]
  • Kuan, C. M., & Liu, T. (1995). Forecasting exchange rates using feedforward and recurrent neural networks. Journal of Applied Econometrics, 10(4), 347-364.
  • Graves, A., Mohamed, A. R., & Hinton, G. (2013, May). Speech recognition with deep recurrent neural networks. In Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on (pp. 6645-6649). IEEE.
  • Egmont-Petersen, M., de Ridder, D., & Handels, H. (2002). Image processing with neural networks—a review. Pattern recognition, 35(10), 2279-2301.
  • Bengio, Y., Simard, P., & Frasconi, P. (1994). Learning long-term dependencies with gradient descent is difficult. Neural Networks, IEEE Transactions on, 5(2), 157-166.
  • Siegelmann, H. T., & Sontag, E. D. (1995). On the computational power of neural nets. Journal of computer and system sciences, 50(1), 132-150.
  • Jaeger, H. (2001). The “echo state” approach to analysing and training recurrent neural networks-with an erratum note. Bonn, Germany: German National Research Center for Information Technology GMD Technical Report, 148, 34.
  • Halbach, M., & Hoffmann, R. (2004, April). Implementing cellular automata in FPGA logic. In Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International (p. 258). IEEE.
  • Rybacki, S., Himmelspach, J., & Uhrmacher, A. M. (2009, September). Experiments with single core, multi-core, and GPU based computation of cellular automata. In Advances in System Simulation, 2009. SIMUL’09. First International Conference on (pp. 62-67). IEEE.
  • Wolfram, S. (1984). Universality and complexity in cellular automata. Physica D: Nonlinear Phenomena, 10(1), 1-35.
  • Weisstein, E. W., Elementary cellular automaton. In Wolfram MathWorld.
  • Cook, M. (2004). Universality in elementary cellular automata. Complex Systems, 15(1), 1-40.
  • Martin, O., Odlyzko, A. M., & Wolfram, S. (1984). Algebraic properties of cellular automata. Communications in mathematical physics, 93(2), 219-258.
  • Steinbach, B., & Posthoff, C. (2009). Boolean Differential Calculus. In Logic Functions and Equations (pp. 75-103). Springer Netherlands.
  • Evans, L. (2010). Partial differential equations (2nd ed.). Providence, R.I.: American Mathematical Society.
  • Weisstein, E. W., Fourier transform. In Wolfram MathWorld.
  • Weisstein, E. W., Parseval’s Theorem. In Wolfram MathWorld.
  • Beer, T. (1981). Walsh transforms. American Journal of Physics, 49(5), 466-472.
  • Xu, G. (2004). Discrete Laplace–Beltrami operators and their convergence. Computer Aided Geometric Design, 21(8), 767-784.
  • Shanks, J. L. (1969). Computation of the fast Walsh-Fourier transform. IEEE Transactions on Computers, (5), 457-459.
  • Johnson, J., & Püschel, M. (2000). In search of the optimal Walsh-Hadamard transform. In Acoustics, Speech, and Signal Processing, 2000. ICASSP’00. Proceedings. 2000 IEEE International Conference on (Vol. 6, pp. 3347-3350). IEEE.
  • Borda, M. (2011). Fundamentals in Information Theory and Coding. Berlin, Germany: Springer-Verlag.
  • Shereshevsky, M. A. (1992). Lyapunov exponents for one-dimensional cellular automata. Journal of Nonlinear Science, 2(1), 1-8.
  • Wolfram, S. (1986). Theory and applications of cellular automata (Vol. 1). Singapore: World Scientific.
  • Stauffer, D. (2001). Cellular Automata: Applications. In Vector and Parallel Processing—VECPAR 2000 (pp. 199-206). Berlin, Germany: Springer-Verlag.
  • Rosin, P. L. (2006). Training cellular automata for image processing. Image Processing, IEEE Transactions on, 15(7), 2076-2087.
  • Nandi, S., Kar, B. K., & Chaudhuri, P. P. (1994). Theory and applications of cellular automata in cryptography. Computers, IEEE Transactions on, 43(12), 1346-1357.
  • Mitchell, M., Crutchfield, J. P., & Hraber, P. T. (1994). Evolving cellular automata to perform computations: Mechanisms and impediments. Physica D: Nonlinear Phenomena, 75(1), 361-391.
  • Cenek, M., & Mitchell, M. (2009). Evolving cellular automata. Encyclopedia of Complexity and Systems Science, 3233-3242.
  • Das, R., Crutchfield, J. P., Mitchell, M., & Hanson, J. M. (1995). Evolving globally synchronized cellular automata. SFI Working Paper 1995-01-005 (1995)