<--- Back to Details
First PageDocument Content
Computability theory / Theoretical computer science / Formal methods / Models of computation / Lambda calculus / Eval / Scheme / Env / Interpreter / Anonymous function / Halting problem / Turing machine
Date: 2005-12-08 08:45:06
Computability theory
Theoretical computer science
Formal methods
Models of computation
Lambda calculus
Eval
Scheme
Env
Interpreter
Anonymous function
Halting problem
Turing machine

Microsoft PowerPoint - universal_machinesv2.ppt

Add to Reading List

Source URL: sicp.csail.mit.edu

Download Document from Source Website

File Size: 78,62 KB

Share Document on Facebook

Similar Documents

The Julia Express Bogumił Kaminski ´ January 4, 2015  Contents

The Julia Express Bogumił Kaminski ´ January 4, 2015 Contents

DocID: 1rtHJ - View Document

Project 5 - The Meta-Circular Evaluator

Project 5 - The Meta-Circular Evaluator

DocID: 1rtvP - View Document

Revised5 Report on the Algorithmic Language Scheme RICHARD H. ABELSON N. I. ADAMS IV D. H. BARTLEY

Revised5 Report on the Algorithmic Language Scheme RICHARD H. ABELSON N. I. ADAMS IV D. H. BARTLEY

DocID: 1rf2e - View Document

Microsoft PowerPoint - Lect02Scheme.ppt

Microsoft PowerPoint - Lect02Scheme.ppt

DocID: 1reMy - View Document

PLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes Jeevana Priya Inala MIT  Advisor: Armando Solar-Lezama

PLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes Jeevana Priya Inala MIT Advisor: Armando Solar-Lezama

DocID: 1rduU - View Document