Theoretical issues and practical problems raised by translation, in light of recent research. The role of translation and translated literature in cultural systems and in the history of literary development. Genre and form (poetry, dramatic literature), language register and tone, metaphor and imagery, word play. Readings in theory (Nida, Even-Zohar, Lefevere, Quine, Catford) combined with workshop practice.

This course will analyze the dynamics of feminist activism in the Americas and other world regions from the mid-20th century to the present day. Interrogating the still popular notion that feminism occurs in "waves," our comparative, historical and ethnographic examination of feminist politics will enable us to theorize continuities, fissures, capillarities, and emergences. We will explore how past and present feminist activism both influences and is influenced by other social movements, exploring emergent feminist formations forged through those interactions.

The course will introduce students to the research process to prepare them for conducting and evaluating research. Topics will include: steps to building a research proposal (literature search, generating hypotheses, hypotheses testing, methods, results, discussion, and statistical analyses). Faculty will present on current research to familiarize students with department research areas.

Introduction to theories and methodologies in psycholinguistics. Comprehension, production, acquisition of language and their relationship to grammatical theories. Biological and cognitive approaches to understanding human language from a cross-linguistic perspective.

Lecture, discussion. Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Graphs, trees, and search. Finite-state machines, regular languages, nondeterministic finite automata, Kleene's Theorem. Problem sets, 2 midterm exams, timed final.

Lecture, discussion. Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Graphs, trees, and search. Finite-state machines, regular languages, nondeterministic finite automata, Kleene's Theorem. Problem sets, 2 midterm exams, timed final.

Development of mathematical reasoning skills for problems that involve uncertainty. Counting and probability -- basic counting problems, probability definitions, mean, variance, binomial distribution, discrete random variables, continuous random variables, Markov and Chebyshev bounds, Laws of large number, and central limit theorem. Probabilistic reasoning -- conditional probability and odds, Bayes' Law, Markov Chains, Bayesian Network, Markov Decision Processes.

Development of mathematical reasoning skills for problems that involve uncertainty. Counting and probability -- basic counting problems, probability definitions, mean, variance, binomial distribution, discrete random variables, continuous random variables, Markov and Chebyshev bounds, Laws of large number, and central limit theorem. Probabilistic reasoning -- conditional probability and odds, Bayes' Law, Markov Chains, Bayesian Network, Markov Decision Processes.