This course explores a range of contemporary scholarship oriented to the study of 'cybercultures,' with a focus on research inspired by ethnographic and more broadly anthropological perspectives. Taking anthropology as a resource for cultural critique, the course will be organized through a set of readings chosen to illustrate central topics concerning the cultural and material practices that comprise digital technologies. We'll examine social histories of automata and automation; the trope of the 'cyber' and its origins in the emergence of cybernetics during the last century; cybergeographies and politics; robots, agents and humanlike machines; bioinformatics and artificial life; online sociality and the cyborg imaginary; ubiquitous and mobile computing; ethnographies of research and development; and geeks, gamers and hacktivists. We'll close by considering the implications for all of these topics of emerging reconceptualizations of sociomaterial relations, informed by feminist science and technology studies.

Cardboard Automata are a playful way to explore simple machine elements while creating a mechanical sculpture. This activity was inspired by the Cabaret Mechanical Theatre, a group of automata builders based in England. Artists like Paul Spooner, Keith Newstead, and Carlos Zapata build beautiful narrative pieces using elegant mechanisms based on cams, gears, springs, and linkages. Working with simple materials, this activity is easy to get started, and may become as complex as your mechanical sculpture ideas.

This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. Upon successful completion of this course, the student will be able to: Create compound statements, expressed in mathematical symbols or in English, to determine the truth or falseness of compound statements and to use the rules of inference to prove a conclusion statement from hypothesis statements by applying the rules of propositional and predicate calculus logic; Prove mathematical statements involving numbers by applying various proof methods, which are based on the rules of inference from logic; Prove the validity of sequences and series and the correctness or repeated processes by applying mathematical induction; Define and identify the terms, rules, and properties of set theory and use these as tools to support problem solving and reasoning in applications of logic, functions, number theory, sequences, counting, probability, trees and graphs, and automata; Calculate probabilities and apply counting rules; Solve recursive problems by applying knowledge of recursive sequences; Create graphs and trees to represent and help prove or disprove statements, make decisions or select from alternative choices to calculate probabilities, to document derivation steps, or to solve problems; Construct and analyze finite state automata, formal languages, and regular expressions. (Computer Science 202)

6.863 is a laboratory-oriented course on the theory and practice of building computer systems for human language processing, with an emphasis on the linguistic, cognitive, and engineering foundations for understanding their design.