Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II




        

Search > Material Results >

6.045J Automata, Computability, and Complexity

        

6.045J Automata, Computability, and Complexity

Logo for 6.045J  Automata, Computability, and Complexity
This course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.
Material Type: Online Course
Date Added to MERLOT: August 10, 2012
Date Modified in MERLOT: October 03, 2012
Author:
Submitter: Sorel Reisman

Details

  • Editor Review avg: 3 rating
  • User Rating (not rated)
  • Comments (none)
  • Learning Exercises (none)
  • Personal Collections (none)
  • Accessibility Info (none)

About

Primary Audience:
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: unsure
Accessiblity Information Available: unsure
Creative Commons: Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Connections



QR Code for this Page

Browse in Categories

Discussion

Discussion for 6.045J Automata, Computability, and Complexity

Log in to participate in the discussions or Register if you are not already a MERLOT member.

Return to Top of Page