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

System software / BIOS / Computer architecture / Boot loaders / Booting

Forth Day: Green Arrays, Inc.  Greg Bailey – Intro: The State of Green Arrays  Stefan Mauerhofer – Eval Board Application: Low Frequency Clock and UART

DocID: 1xVPy - View Document

USB / Computer architecture / Microcontrollers / Computing / Computer hardware / ARM architecture / Linux-based devices / Single-board computers / Serial Peripheral Interface / Secure Digital / Raspberry Pi / Booting

GreenArrays ™ AN004 Getting Started with Eval Board EVB001

DocID: 1xUUv - View Document

PDF Document

DocID: 1xJFy - View Document

PDF Document

DocID: 1xyTw - View Document

PDF Document

DocID: 1xmj7 - View Document