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

Alloy as an Introduction to Formal Methods

DocID: 1xVY1 - View Document

Culture in Berlin / Education in Berlin / Institute for Media and Communication Policy / Bernhard Steffen / Stochastic process / States of Germany / Germany

Integrated Formal Methods

DocID: 1xVBb - View Document

Software engineering / Theoretical computer science / Formal methods / Computing / Computer science / Computer security / Model checking / Verification / Formal verification / Carnegie Mellon University / Proof-carrying code / Software Engineering Institute

Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University

DocID: 1xUHE - View Document

Arithmetic / Interval / Bracket

Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian Fischmeister

DocID: 1xUCm - View Document

Mathematics / Temporal logic / Mathematical analysis / Theoretical computer science / Linear temporal logic / Mathematical logic / Formal languages / Computation tree logic / Constructible universe / Markov decision process / Well-formed formula / IP

Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ

DocID: 1xUrV - View Document