Searching for completeness : 8 results found | RSS Feed for this search

22.091 Nuclear Reactor Safety (MIT) 22.091 Nuclear Reactor Safety (MIT)

Description

Problems in nuclear engineering often involve applying knowledge from many disciplines simultaneously in achieving satisfactory solutions. The course will focus on understanding the complete nuclear reactor system including the balance of plant, support systems and resulting interdependencies affecting the overall safety of the plant and regulatory oversight. Both the Seabrook and Pilgrim nuclear plant simulators will be used as part of the educational experience to provide as realistic as possible understanding of nuclear power systems short of being at the reactor. Problems in nuclear engineering often involve applying knowledge from many disciplines simultaneously in achieving satisfactory solutions. The course will focus on understanding the complete nuclear reactor system including the balance of plant, support systems and resulting interdependencies affecting the overall safety of the plant and regulatory oversight. Both the Seabrook and Pilgrim nuclear plant simulators will be used as part of the educational experience to provide as realistic as possible understanding of nuclear power systems short of being at the reactor.Subjects

nuclear | nuclear | reactor | reactor | safety | safety | dryout heat flux | dryout heat flux | preexisting hydrogen | preexisting hydrogen | blowdown gases | blowdown gases | downward propagation limit | downward propagation limit | debris dispersal | debris dispersal | direct containment heating | direct containment heating | gas blowthrough | gas blowthrough | seal table room | seal table room | subcompartment structures | subcompartment structures | compartmentalized geometries | compartmentalized geometries | overlying liquid layer | overlying liquid layer | preexisting atmosphere | preexisting atmosphere | blowdown time | blowdown time | melt generator | melt generator | detonation adiabatic | detonation adiabatic | thermohydraulic codes | thermohydraulic codes | hydrodynamic fragmentation | hydrodynamic fragmentation | vent clearing | vent clearing | combustion completeness | combustion completeness | containment pressurization | containment pressurization | melt retention | melt retention | containment loads | containment loads | melt ejection | melt ejection | containment geometry | containment geometry | hole ablation | hole ablation | Sandia National Laboratories | Sandia National Laboratories | Heat Transfer Conf | Heat Transfer Conf | Nuclear Regulatory Commission Report | Nuclear Regulatory Commission Report | Heat Mass Transfer | Heat Mass Transfer | The Combustion Institute | The Combustion Institute | Combustion Symposium International | Combustion Symposium International | New York | New York | Santa Barbara | Santa Barbara | Argonne National Laboratory | Argonne National Laboratory | Fluid Mech | Fluid Mech | Zion Probabilistic Safety Study | Zion Probabilistic Safety Study | Los Angeles | Los Angeles | Impact of Hydrogen | Impact of Hydrogen | Topical Meeting | Topical Meeting | Water Reactor Safety | Water Reactor Safety | Water Trans | Water Trans | Academic Press All | Academic Press All | American Society of Mechanical Engineers | American Society of Mechanical Engineers | Specialists Meeting | Specialists Meeting | University of California | University of California | Brookhaven National Laboratory | Brookhaven National Laboratory | Calvert Cliffs | Calvert Cliffs | Fourth Int | Fourth Int | International Conference | International Conference | New Trends. | New Trends.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.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-energy.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course provides a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of "computer science beyond computers": that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds. Beginning in antiquity—with Euclid's algorithm and other ancient examples of computational thinking—the course will progress rapidly through propositional logic, Turing machines and computability, finite automata, Gödel's theorems, efficient algorithms and reducibility, NP-completeness, the P versus NP problem, decision trees and other concrete computational models, the power of randomness, cryptography and one-way functions, computational theories of learning, interactive proofs, and q This course provides a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of "computer science beyond computers": that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds. Beginning in antiquity—with Euclid's algorithm and other ancient examples of computational thinking—the course will progress rapidly through propositional logic, Turing machines and computability, finite automata, Gödel's theorems, efficient algorithms and reducibility, NP-completeness, the P versus NP problem, decision trees and other concrete computational models, the power of randomness, cryptography and one-way functions, computational theories of learning, interactive proofs, and qSubjects

computer science | computer science | theoretical computer science | theoretical computer science | logic | logic | turing machines | turing machines | computability | computability | finite automata | finite automata | godel | godel | complexity | complexity | polynomial time | polynomial time | efficient algorithms | efficient algorithms | reducibility | reducibility | p and np | p and np | np completeness | np completeness | private key cryptography | private key cryptography | public key cryptography | public key cryptography | pac learning | pac learning | quantum computing | quantum computing | quantum algorithms | quantum algorithmsLicense

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.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.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 systemsLicense

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.htmSite sourced from

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

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.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 systemsLicense

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.htmSite sourced from

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

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.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 systemsLicense

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.htmSite sourced from

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

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.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 systemsLicense

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.htmSite sourced from

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

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata22.091 Nuclear Reactor Safety (MIT)

Description

Problems in nuclear engineering often involve applying knowledge from many disciplines simultaneously in achieving satisfactory solutions. The course will focus on understanding the complete nuclear reactor system including the balance of plant, support systems and resulting interdependencies affecting the overall safety of the plant and regulatory oversight. Both the Seabrook and Pilgrim nuclear plant simulators will be used as part of the educational experience to provide as realistic as possible understanding of nuclear power systems short of being at the reactor.Subjects

nuclear | reactor | safety | dryout heat flux | preexisting hydrogen | blowdown gases | downward propagation limit | debris dispersal | direct containment heating | gas blowthrough | seal table room | subcompartment structures | compartmentalized geometries | overlying liquid layer | preexisting atmosphere | blowdown time | melt generator | detonation adiabatic | thermohydraulic codes | hydrodynamic fragmentation | vent clearing | combustion completeness | containment pressurization | melt retention | containment loads | melt ejection | containment geometry | hole ablation | Sandia National Laboratories | Heat Transfer Conf | Nuclear Regulatory Commission Report | Heat Mass Transfer | The Combustion Institute | Combustion Symposium International | New York | Santa Barbara | Argonne National Laboratory | Fluid Mech | Zion Probabilistic Safety Study | Los Angeles | Impact of Hydrogen | Topical Meeting | Water Reactor Safety | Water Trans | Academic Press All | American Society of Mechanical Engineers | Specialists Meeting | University of California | Brookhaven National Laboratory | Calvert Cliffs | Fourth Int | International Conference | New Trends.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.htmSite sourced from

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

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.080 Great Ideas in Theoretical Computer Science (MIT)

Description

This course provides a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of "computer science beyond computers": that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds. Beginning in antiquity—with Euclid's algorithm and other ancient examples of computational thinking—the course will progress rapidly through propositional logic, Turing machines and computability, finite automata, Gödel's theorems, efficient algorithms and reducibility, NP-completeness, the P versus NP problem, decision trees and other concrete computational models, the power of randomness, cryptography and one-way functions, computational theories of learning, interactive proofs, and qSubjects

computer science | theoretical computer science | logic | turing machines | computability | finite automata | godel | complexity | polynomial time | efficient algorithms | reducibility | p and np | np completeness | private key cryptography | public key cryptography | pac learning | quantum computing | quantum algorithmsLicense

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.htmSite sourced from

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

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata