Searching for oracles : 11 results found | RSS Feed for this search

18.404J Theory of Computation (MIT) 18.404J Theory of Computation (MIT)

Description

A more extensive and theoretical treatment of the material in 18.400J, Automata, Computability, and Complexity, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems. A more extensive and theoretical treatment of the material in 18.400J, Automata, Computability, and Complexity, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.

Subjects

computability | computability | computational complexity theory | computational complexity theory | Regular and context-free languages | Regular and context-free languages | Decidable and undecidable problems | Decidable and undecidable problems | reducibility | reducibility | recursive function theory | recursive function theory | Time and space measures on computation | Time and space measures on computation | completeness | completeness | hierarchy theorems | hierarchy theorems | inherently complex problems | inherently complex problems | oracles | oracles | probabilistic computation | probabilistic computation | interactive proof systems | interactive proof systems | 18.404 | 18.404 | 6.840 | 6.840

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.404J Theory of Computation (MIT) 18.404J Theory of Computation (MIT)

Description

This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory. This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.

Subjects

Computability | computational complexity theory | Computability | computational complexity theory | Regular and context-free languages | Regular and context-free languages | Decidable and undecidable problems | reducibility | recursive function theory | Decidable and undecidable problems | reducibility | recursive function theory | Time and space measures on computation | completeness | hierarchy theorems | inherently complex problems | oracles | probabilistic computation | and interactive proof systems | Time and space measures on computation | completeness | hierarchy theorems | inherently complex problems | oracles | probabilistic computation | and interactive proof systems

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.405J Advanced Complexity Theory (MIT) 18.405J Advanced Complexity Theory (MIT)

Description

The topics for this course cover various aspects of complexity theory, such as  the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no applications were involved. The topics for this course cover various aspects of complexity theory, such as  the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no applications were involved.

Subjects

Basic time and space classes | Basic time and space classes | polynomial-time hierarchy | polynomial-time hierarchy | Randomized classes: RP | BPP | RL | and their relation to PH | Randomized classes: RP | BPP | RL | and their relation to PH | Counting classes: #P | Counting classes: #P | Non-uniform classes | Non-uniform classes | Oracles | relativization | Oracles | relativization | Interactive proof systems | Interactive proof systems | Pseudo-random generators | Pseudo-random generators | randomness | randomness | Some circuit lower bounds--monotone and AC0. | Some circuit lower bounds--monotone and AC0. | oracles | oracles | relativization | relativization | randomized classes | randomized classes | RP | RP | BPP | BPP | RL | RL | PH | PH | circuit lower bonds | circuit lower bonds | monotone | monotone | AC0 | AC0 | basic time classes | basic time classes | basic space classes | basic space classes | 18.405 | 18.405 | 6.841 | 6.841

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.405J Advanced Complexity Theory (MIT) 18.405J Advanced Complexity Theory (MIT)

Description

The topics for this course cover various aspects of complexity theory, such as  the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no applications were involved. The topics for this course cover various aspects of complexity theory, such as  the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no applications were involved.

Subjects

Basic time and space classes | Basic time and space classes | polynomial-time hierarchy | polynomial-time hierarchy | Randomized classes: RP | BPP | RL | and their relation to PH | Randomized classes: RP | BPP | RL | and their relation to PH | Counting classes: #P | Counting classes: #P | Non-uniform classes | Non-uniform classes | Oracles | relativization | Oracles | relativization | Interactive proof systems | Interactive proof systems | Pseudo-random generators | Pseudo-random generators | randomness | randomness | Some circuit lower bounds--monotone and AC0. | Some circuit lower bounds--monotone and AC0. | oracles | oracles | relativization | relativization | randomized classes | randomized classes | RP | RP | BPP | BPP | RL | RL | PH | PH | circuit lower bonds | circuit lower bonds | monotone | monotone | AC0 | AC0 | basic time classes | basic time classes | basic space classes | basic space classes | 18.405 | 18.405 | 6.841 | 6.841

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.404J Theory of Computation (MIT)

Description

This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.

Subjects

Computability | computational complexity theory | Regular and context-free languages | Decidable and undecidable problems | reducibility | recursive function theory | Time and space measures on computation | completeness | hierarchy theorems | inherently complex problems | oracles | probabilistic computation | and interactive proof systems

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allportuguesecourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.404J Theory of Computation (MIT)

Description

This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.

Subjects

Computability | computational complexity theory | Regular and context-free languages | Decidable and undecidable problems | reducibility | recursive function theory | Time and space measures on computation | completeness | hierarchy theorems | inherently complex problems | oracles | probabilistic computation | and interactive proof systems

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allspanishcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Coracles on the Thames

Description

Subjects

england | london | wales | ships | cymru | rivers | llyfrgellgenedlaetholcymru | nationallibraryofwales | filmnegatives | coracles | saintdavidsday | mannerscustoms | charlesgeoff19092002 | negyddffilm

License

No known copyright restrictions

Site sourced from

http://api.flickr.com/services/feeds/photos_public.gne?id=37199428@N06&lang=en-us&format=rss_200

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

A man and his coracle on the Teifi River, near Cardigan

Description

Subjects

wales | cymru | rivers | olderpeople | llyfrgellgenedlaetholcymru | nationallibraryofwales | filmnegatives | coracles | charlesgeoff19092002 | negyddffilm

License

No known copyright restrictions

Site sourced from

http://api.flickr.com/services/feeds/photos_public.gne?id=37199428@N06&lang=en-us&format=rss_200

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.404J Theory of Computation (MIT)

Description

A more extensive and theoretical treatment of the material in 18.400J, Automata, Computability, and Complexity, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.

Subjects

computability | computational complexity theory | Regular and context-free languages | Decidable and undecidable problems | reducibility | recursive function theory | Time and space measures on computation | completeness | hierarchy theorems | inherently complex problems | oracles | probabilistic computation | interactive proof systems | 18.404 | 6.840

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.404J Theory of Computation (MIT)

Description

This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.

Subjects

Computability | computational complexity theory | Regular and context-free languages | Decidable and undecidable problems | reducibility | recursive function theory | Time and space measures on computation | completeness | hierarchy theorems | inherently complex problems | oracles | probabilistic computation | and interactive proof systems

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.405J Advanced Complexity Theory (MIT)

Description

The topics for this course cover various aspects of complexity theory, such as  the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no applications were involved.

Subjects

Basic time and space classes | polynomial-time hierarchy | Randomized classes: RP | BPP | RL | and their relation to PH | Counting classes: #P | Non-uniform classes | Oracles | relativization | Interactive proof systems | Pseudo-random generators | randomness | Some circuit lower bounds--monotone and AC0. | oracles | relativization | randomized classes | RP | BPP | RL | PH | circuit lower bonds | monotone | AC0 | basic time classes | basic space classes | 18.405 | 6.841

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata