6.079 Introduction to Convex Optimization (MIT)

This course aims to give students the tools and training to recognize convex optimization problems that arise in scientific and engineering applications, presenting the basic theory, and concentrating on modeling aspects and results that are useful in applications. Topics include convex sets, convex functions, optimization problems, least-squares, linear and quadratic programs, semidefinite programming, optimality conditions, and duality theory. Applications to signal processing, control, machin

21A.215 Medical Anthropology (MIT)

Examination of how medicine is practiced cross-culturally, with particular emphasis on Western biomedicine. Analysis of medical practice as a cultural system, focusing on the human, as opposed to the biological, side of things. Also, examines how we and people in other cultures think of disease, health, body, and mind.

24.02 Moral Problems and the Good Life (MIT)

Subject examines classic texts from the history of Western moral philosophy, and their answers to the question of what is the best way to live. These texts include works by Plato, Aristotle, Hobbes, Hume, Kant, and J. S. Mill. Among the questions that arise are: What is it to have a good life? How important is moral integrity, personal happiness, individual autonomy, and self expression, if one is to live in the best way that one can? Emphasis on close analysis and the evaluation of philosophica

5.111 Principles of Chemical Science (MIT)

Introduction to chemistry, with emphasis on basic principles of atomic and molecular electronic structure, thermodynamics, acid-base and redox equilibria, chemical kinetics, and catalysis. Introduction to the chemistry of biological, inorganic, and organic molecules.

18.312 Algebraic Combinatorics (MIT)

Applications of algebra to combinatorics and conversely. Topics include enumeration methods, partially ordered sets and lattices, matching theory, partitions and tableaux, algebraic graph theory, and combinatorics of polytopes.

18.312 Algebraic Combinatorics (MIT)

Applications of algebra to combinatorics and conversely. Topics include enumeration methods, partially ordered sets and lattices, matching theory, partitions and tableaux, algebraic graph theory, and combinatorics of polytopes.

8.323 Relativistic Quantum Field Theory I (MIT)

In 8.323, Relativistic Quantum Field Theory I, concepts and basic techniques are developed through applications in elementary particle physics, and condensed matter physics. Topics include: Classical field theory, symmetries, and Noether's theorem. Quantization of scalar fields and spin 1/2 fields. Interacting fields and Feynman diagrams.

8.323 Relativistic Quantum Field Theory I (MIT)

In 8.323, Relativistic Quantum Field Theory I, concepts and basic techniques are developed through applications in elementary particle physics, and condensed matter physics. Topics include: Classical field theory, symmetries, and Noether's theorem. Quantization of scalar fields and spin 1/2 fields. Interacting fields and Feynman diagrams.

11.127 Computer Games and Simulations for Investigation and Education (MIT)

Project-based subject in which students from multiple disciplines are encouraged to develop and investigate systems and ideas from their fields of study as they explore the process of building and testing models and simulations. Explores various modeling software packages, criteria for developing the most appropriate simulation for a given situation, and methods for evaluating the success and utility of models. Students with an education focus consider what and how people learn from simulations

6.441 Transmission of Information (MIT)

6.441 offers an introduction to the quantitative theory of information and its applications to reliable, efficient communication systems. Topics include: mathematical definition and properties of information; source coding theorem, lossless compression of data, optimal lossless coding; noisy communication channels, channel coding theorem, the source-channel separation theorem, multiple access channels, broadcast channels, Gaussian noise, and time-varying channels.

6.042J Mathematics for Computer Science (SMA 5512) (MIT)

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds:
Fundamental concepts of Mathematics: definitions, proofs, sets, functions, relations.
Discrete structures: modular arithmetic, graphs, state machines, counting.
Discrete probability theory.
This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science).
Contributors
Srin

15.083J Integer Programming and Combinatorial Optimization (MIT)

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

6.972 Game Theory and Mechanism Design (MIT)

This course is offered to graduates and is an introduction to fundamentals of game theory and mechanism design with motivations drawn from various applications including distributed control of wireline and wireless communication networks, incentive-compatible/dynamic resource allocation, and pricing. Emphasis is placed on the foundations of the theory, mathematical tools, as well as modeling and the equilibrium notions in different environments. Topics covered include: normal form games, learnin

6.972 Game Theory and Mechanism Design (MIT)

This course is offered to graduates and is an introduction to fundamentals of game theory and mechanism design with motivations drawn from various applications including distributed control of wireline and wireless communication networks, incentive-compatible/dynamic resource allocation, and pricing. Emphasis is placed on the foundations of the theory, mathematical tools, as well as modeling and the equilibrium notions in different environments. Topics covered include: normal form games, learnin

14.126 Game Theory (MIT)

This course is a rigorous investigation of the evolutionary and epistemic foundations of solution concepts, such as rationalizability and Nash equilibrium. It covers classical topics, such as repeated games, bargaining, and supermodular games as well as new topics such as global games, heterogeneous priors, psychological games, and games without expected utility maximization. Applications are provided when available.

14.123 Microeconomic Theory III (MIT)

This half-semester course discusses decision theory and topics in game theory. We present models of individual decision-making under certainty and uncertainty. Topics include preference orderings, expected utility, risk, stochastic dominance, supermodularity, monotone comparative statics, background risk, game theory, rationalizability, iterated strict dominance multi-stage games, sequential equilibrium, trembling-hand perfection, stability, signaling games, theory of auctions, global games, rep

Too big to fail, too big to be privately owned

Description not set

The Effect of Distribution on the Crisis

Description not set

Critique of 'Financial Reform' Bill and of Republican Opposition

Description not set

A Roadmap for Education Technology

This report describes the initial findings of several workshops convened in 2009 to consider the future of education and in particular the role of technology and computer science in education. Through a series of facilitated collaborative workshops, leaders in several disciplines engaged in conversations that cast computers in the role of facilitating education in the future and recommended a research agenda for federal funding.,Research report