Back to Results
First PageMeta Content
Computer science / Theory of computation / Alan Turing / Turing machine / Models of computation / Computable function / Turing reduction / Universal Turing machine / Halting problem / Computability theory / Theoretical computer science / Mathematics


Fundamentals of Computing Leonid A. Levin These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic
Add to Reading List

Document Date: 2015-03-30 07:56:29


Open Document

File Size: 346,54 KB

Share Result on Facebook

Company

ABC / /

Facility

store M’s / Boston University / California Institute of Technology / University of California at Berkeley / /

IndustryTerm

Formal proof systems / real and ideal computing devices / algorithm computing / computing / above algorithm / exhaustive search / fixed connection sorting network / /

Organization

California Institute of Technology / University of California / National Science Foundation / MIT / UC Berkeley / BU / Boston University / U.S. Securities and Exchange Commission / /

Person

John von Neumann / Rabin / Richard Karp / Manuel Blum / M. Blum / Carlo Primality / Conway Guy / /

Position

author / PM / CA / Prime Minister / given multi-head / instructor for questions / active player / Universal Multi-head / i-th player / Multi-Head / player / head / left end / /

ProvinceOrState

California / /

Technology

Cryptography / above algorithm / PM algorithm / 5.2 Randomized Algorithms / Simulation / 2 2 3 4 5 2 Universal Algorithm / /

URL

http /

SocialTag