Presented

• Project80

Talks

People Meeters

Slightly nontraditional Ted class, which is that it is in complete modular architecture: no large group lectures, work is done in 2-3 week sprints.

First two days, we will be doing intro together. There are 12 modules, and you do 6. There will be core modules and branches.

There are 3 symposiums which the groups share out. This class is very hard; we are using a graduate school textbook. We will be sidestepping some depth: main idea is to show the big area.

The economy of credit is an effect where credit is being traded liberally, and people are buying stocks on large margins and unable to pay back.

Goal: search for a path (sequence of edits) from start to final string, whereby:

• initial state is the word we are transforming
• operators: insert, delete, substitute
• goal state: the word we end up at
• path cost: cost of the path we are trying to minimize

Sequence of all edits is huge! so DP.

For two strings, let’s define:

• \(X\) of length \(n\)
• \(Y\) of length \(m\)

we define some \(D(i,j)\) as the edit distance between substring \(X[1:i]\) and \(Y[1:j]\).