7. Executable Grammars: Seeking the Minimal Extendable Self-Compiling Compiler (March 4, 2009)
Listen now
Description
Bill McKeeman, a Fellow at MathWorks and adjunct faculty at the Computer Science Department of Dartmouth College, reveals his goal to create the smallest extendable self-compiling compiler. (March 4, 2009)
More Episodes
Tim Roughgarden, assistant professor of Computer Science at Stanford, illustrates two of the main themes in the field of algorithmic game theory via specific examples: performance guarantees for systems with autonomous users. (March 11, 2009)
Published 09/30/09
Daniel Kreiss, a PhD candidate and the Rebele First Amendment Fellow in Stanford's Department of Communication, discusses technical infrastructures, political institutions, and social practices. (February 25, 2009)
Published 09/30/09
John R. Koza, consulting professor in the Department Electrical Engineering at Stanford University, discusses the Darwinian computational technique of genetic programming to automatically design complex structures. (February 18, 2009)
Published 09/30/09