<--- 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

Software engineering / Computing / Computer programming / Compiler construction / Source code / Parsing / Lexical analysis / Programming language implementation / Parser generators / Syntax / Identifier / String literal

Thorsten Ball writing an INTERPRETER in go

DocID: 1xTrb - View Document

Is s ue Spring 2014 Alaska Immigration Justice Project ● Language Interpreter Center ● Research & Policy Institute  AIJ

DocID: 1vooi - View Document

高山市中心市街地・地域通訳案内士登録簿(業務区域:岐阜県高山市の中心市街地) Local Government-licensed Guide Interpreter(Business Area: Effective only in the area of Takayama downtow

DocID: 1vmWx - View Document

List of Registered Amharic Language Court Interpreters In Louisiana, a court interpreter is listed as “registered” in the language for which he tested if the interpreter: completes a two day training course, passes a

DocID: 1vk9i - View Document

Becoming an Interpreter with the

DocID: 1viBL - View Document