Please submit your PS7 by posting a comment to this post.

Some reminders from the PS7 handout are below, see that handout for full details.

If you work in a team, your team should jointly post a single submission with all of your names on it.

Your post should include:

- the names of everyone on the team
- a description of your target audience
- either the artifact itself or a link to it if it is hosted elsewhere
- (optionally) a poetic license statement

Note: if you log into your account on this blog, you can post a comment without needing moderation. Otherwise, you can post a comment but it won’t appear until I approve it.

Remember to send me email before 5pm today (Monday, May 3) if you would like to present or perform your artifact in class tomorrow.

a. Kevin Leach

b. CS majors who have taken CS3102 and have a grasp of the traveling salesman problem.

c. http://leach.yi.org:1028/special/tsp/tsp.php

Also, source code in http://leach.yi.org:1028/special/tsp/tsp_art.zip

a. Seth Kaye

b. Hands-on/Visual learners

c-d. Explanation and picture here:

https://docs.google.com/Doc?docid=0Acs1oGw_DhGoZGRwdnh0NGtfMTJ3cTJic2hndg&hl=en

a. Yang Yang Zheng

b. Elementary and middle school students

c. I drew a comic for this assignment. There are two versions of the same comic. One version might be easier to read than the other version.

version one:

https://docs.google.com/leaf?id=0B20a1HQxS04iMzMyZjg4ZDEtYzcwNi00OTE1LWIyNTEtOWRiMGQ0MTBlMTUx&hl=en

version two:

https://docs.google.com/leaf?id=0B20a1HQxS04iOGU5MDBjMjMtYmQ0OS00NWRhLTkwYjAtNzZmOWQwMTRhNWY5&hl=en

d. https://docs.google.com/Doc?docid=0AW0a1HQxS04iZGc4ODltN3dfMWhqZnpnZmh6&hl=en

a. Dan Andrino, Peter Chapman, Michael Chen, Chris Lee, Nicholas Loffredo

b. High School students who have taken an introductory CS course

c. http://people.virginia.edu/~ctl4f/Pegboard/

d. We assume our target audience does not have the vocabulary of a computer scientist.

Kam Him Tam

Middle school students

http://imgur.com/pa1eV

What happens if P=NP

a. Mimi Stein

b. Students who know basically what a Turing Machine is

c. https://docs.google.com/Doc?docid=0AVj_xL6EH6nKZGM1bWhoNTNfMTNkOWRmOXQ0Mg&hl=en

a)Jason Dunn

b)Someone with understanding of complexity and an appreciation for poetry

c) https://docs.google.com/Doc?docid=0AQLQfVkWNcRCZGM5bXo2a3JfNWc2M2piOHI0&hl=en

a. Matthew Kishiyama

b. Elementary and middle school students being introduced to P (!)= NP theory for the first time.

c. http://people.virginia.edu/~mmk2d/pete_complete.pdf

a. Andrew Gaubatz

b. Non-CS Students High School and up

c. http://agaubatz.com/silverlight/theoryps7/SubsetSumInvaders.html

a. Derek-Eli Nofziger

b. Those curious in how significant these problems are

c. http://imgur.com/Gfxoi.jpg

d. Inspired by Death and Taxes, based on Google search results

Tom Smilack and Jeff Geiger

http://smilack.net/smilackftp/school/tfs3p_jeg8c_ps7.pdf

Everything explained on last page

a. John Carone and James Harrison

b. International Spies/Middle School age +

c. https://docs.google.com/leaf?id=0B_P-bMKhSAHtMDlhNGI2M2EtNTJmMi00MjIxLTg3YzAtZTI4NmE0ZTRkMjVj&hl=en

d. Enjoy

a) Arthur Gordon, Allison Gurlitz, Stephen Lam, Eugene Moy

b)Our target audience is anyone familiar with the elusive P vs. NP and the traveling salesman problems. We do not explicitly explain the problems, so viewers must be at least familiar with the subject matter to understand all of the references.

c)http://www.mediafire.com/?zwm2nrajyum

Our artifact borrows a 4-minute clip from the 2004 German film “Der Untergang (Downfall).” The scene involves Hitler being informed of bad news, which leads him to break down and rant at his subordinates. This clip has been widely parodied on youtube.com, by interchanging the subtitles with various subject matters.

d)Contrary to the reply of the general to Hitler, faster than factorial time solutions to the traveling salesman problem have been discovered, though none are in deterministic polynomial time.

a) Arthur Gordon, Allison Gurlitz, Stephen Lam, Eugene Moy

b) Our target audience is anyone familiar with the elusive P vs. NP and the traveling salesman problems. We do not explicitly explain the problems, so viewers must be at least familiar with the subject matter to understand all of the references.

c) http://www.mediafire.com/?zwm2nrajyum

Our artifact borrows a 4-minute clip from the 2004 German film “Der Untergang (Downfall).” The scene involves Hitler being informed of bad news, which leads him to break down and rant at his subordinates. This clip has been widely parodied on youtube.com, by interchanging the subtitles with various subject matters.

d) Contrary to the reply of the general to Hitler, faster than factorial time solutions to the traveling salesman problem have been discovered, though none are in deterministic polynomial time.

http://www.youtube.com/watch?v=GSIodz9GWxc

Uploaded to youtube for easier access.

a. Erik Davis

b. High-schoolers or college students

c. http://docs.google.com/Doc?docid=0Aa9dhCYbmF8rZGNwMmMzMndfMTI0ZGs1M3p2cmY&hl=en

d. Included in footnotes, see problem set

a. Adis Ljubovic

b. The target audience is people who are familiar with the P vs. NP problem and possibly familiar with Maximum Independent Set Problem(called INDEPENDENT-SET problem in comic).

c. https://doc-14-8k-docs.googleusercontent.com/docs/secure/rb76hs62dof3nkvdingba5cedl9ltjag/g3ihr2blh9nouqes04tul3b3bas9q9jl/1272931200000/11502889419769978290/*/0BxF1vtXLmw7pZjE5ZTYyN2UtNjAxNC00NzZjLTg1OWMtZjU5YzdjMmVjNDBi?h=03491947472532422739

Footnote: The purpose of the cartoon is to demonstrate that people should be aware of when problems are NP complete, and that they should not waste their time on these problems that probably can’t be solved efficiently.

The problem in the comic is basically the Maximum Independent set problem, which is the problem of finding the largest set of vertices where no vertices are adjacent(connected by a single edge). Each person is represent by a vertex, and hatred between two people is represented by an edge(if two people get along, they do not have an edge connected them).

The whole link did not fully “link” for some reason, so copying and pasting the whole link might be best.

a) Christopher Nostrand

b) My parents

c) https://71bglw.bay.livefilestore.com/y1muq8DZQNiY6sYQ15Z-Nb05TOvowkiozkJDbCu3ycZZFhkdYBsf1nNbBlc4Jcox3ZwVGGRTKUNh4MLtp5rfHYS3o3VspuQ3jdCAKH5moCk7IquFQiovCjnYl6FR7yJsS6jinLlZMI7cRMUkSx301vbJg/ps7.pdf

d) To clarify, this is about what a TM would say if it could talk so everything is skewed towards that angle. The italicized words refer to their theoretical meaning (decides languages decided by a TM is computable; determined a deterministic TM). In the third stanza, the TM is suggesting P≠NP as is common belief, but tries to prove P=NP. The idea is the TM is egotistical and wants to be as powerful as any other machine. In truth, the answer the question is unknown.

a) Eric Mun

b) people who buy stuff online

c-d) http://docs.google.com/View?id=dc3q57ts_19ct2g45d3

1. Nathan Case, Allison Light, Tyler Richmond

2. CS students between CS 2110 and CS 2150

3. https://docs.google.com/Doc?docid=0AZXF47QmaigbZHA0bXh6cV8yaGcyZHA4Zmg&hl=en

4. Some aspects of the P = NP problem have been very terribly compared to situations that may seem unrelated but we assure you that with enough thought, everything makes sense. (See the write-up)

*When posting this, no pictures of the project have been uploaded. We wrote up a short paper on the project and will be presenting in class (hopefully we’ll get pictures of it in class!)

a] Albert Mayo

b] Any person with a basic knowledge of the halting problem

c]here or here

a. Jichao Li

b. CS111X Students

c. http://jichao.li/cs3102-ps7

Christopher Jones (cmj7gh)

All further information is here:

https://docs.google.com/Doc?docid=0AWE8CRnBC1XGZGZzNjlnbmtfNTZjdnRyenJkbg&hl=en

My file is emailed to you because I couldn’t figure out how to attach it

a. Todd Brown

b. Golfers

c. http://www.mediafire.com/?ziej4cy4gnc

Team: John Frank

Target Audience: late high school – early college w/ prior knowledge of complexity and basic knowledge of Turing Machines

Artifact: http://docs.google.com/Doc?docid=0ARfSyg1iFXe3ZGhkMjU2a2pfMGNkNWM1NGYz&hl=en

Artistic License: See link

Topic: Nicolas Cage is a Non-Deterministic Turing Machine

a) Travis H. Cook

b) Music Majors and those who are musically inclined

c) “Lexodym PNP” song under link. Program Notes: The song compares the idea of composition to solving a problem. We compare listening to music to verifying an answer to a problem and composing to solving the problem. “Lexodym PNP” is comprised of two parts with the first half being a simple chord progression and the second half is a faster, syncopated version of the same chord progression. If P=NP, the result would be analogous to being able to compose the second half of the piece (syncopated) in same amount of steps as the first half (straight progression). Enjoy!

Link: http://www.4shared.com/audio/ULUhSzgx/LexodymPNP.html

d) Poetic License: The analogy to composing to problem solving is not perfect; problem solving generally involves only one answer while composing yields infinitely many solutions. Our idea of composition will reflect the need to compose a certain song (definite selection of notes and rhythms). Another issue with the analogy is that adding syncopation does not necessarily mean that composing a piece now runs in exponential time; it could be considered a higher polynomial. We focus on the fact that NP and syncopation are more complex than P and straight chord progressions, and therefore take more steps.

a)Brenden Alexis-Robinson

b) lego lovers

c)in class

A. William Hrachovina, Jr.

B. Targeted toward younger children helping them understand that the reason computers can’t do everything for them is because of the idea of P and NP problems.

C. http://people.virginia.edu/~wjh9v/ps7.png

D. I am not a great artist, but I do understand that it takes a certain amount of creativity in order to be an effective computer science. This idea has been thoroughly explained in this class, and I have tried to demonstrate some of this skill in this artifact.

I have determined that there is a hidden meaning in this comic that is not necessarily evident at first, as it was not evident to me until now. Because the father was convinced rather quickly that his son would not give up on programming and actually clean his room, he made the decision in polynomial time.

However, because the child still continues to program even after hearing what his father said, it will take him quite a long time to figure out he will never be able to solve the problem of cleaning his room, and that it would be better to just do it himself. The child is representative of NP as he will keep looking for a way to solve the problem until it happens.

a) Harry Bowron

b) Small children with little understanding of P vs NP

c) http://imgur.com/lzWUt.png

d) This doesn’t truly capture the idea of P being a subset of NP but instead focuses on the differences between the two.

a) Alex Johnson and Irene Beckman

b) Computer science students who like to color/have an inner child

c) http://www.mediafire.com/file/u3ntmgz2iyj/TheoryPS7.doc

Nikhita Karki

(a) Nikhita Karki

(b) Target Audience: 7th-8th-9th graders.(It’ll be a plus if they own a XBOX 360 + Call of Duty 4 & if they know who Albus Dumbledore is.)

(c) http://rci.rutgers.edu/~kharkwal/Nikhita_Karki/CS3102_PS7_Solution.pdf

It’s a fun tutorial on Turing Machines!

Ryan Matt

a: Ryan Matt

b: A baking class

c: https://docs.google.com/leaf?id=0B-Qve6XTSwBHNGZlNjM4YWUtOTQ3ZS00MGM2LWI5OTItYzJkOTlmNWRlNGQ5&hl=en

https://docs.google.com/leaf?id=0B-Qve6XTSwBHNDQ3MmY0NmEtZjBmYS00MGQyLTkyYzgtMjEzNjhlZmYzMGFk&hl=en

Forgot to explain: The cake represents the ambiguity between the P and NP sets. If you look at the top of the cake, you see the two distinct sets (P is represented by the green and NP is represented by the NP. If you look at the side of the cake, they’re both one contiguous set.

a.) David Renardy (dr7jx)

b.) Five year olds (or more specifically sadistic parents of five year olds)

c.)https://docs.google.com/a/virginia.edu/fileview?id=0B3ydAdZqA1JWZjFmNmIwOTAtOTE1OS00ZDgwLTgyNDQtOTY4ZDNlZWRhYmNh&hl=en

d.) included inside the document

a.) David Renardy (dr7jx)

b.) Five year olds (or more specifically sadistic parents of five year olds)

c.) https://docs.google.com/a/virginia.edu/fileview?id=0B3ydAdZqA1JWZjFmNmIwOTAtOTE1OS00ZDgwLTgyNDQtOTY4ZDNlZWRhYmNh&hl=en

d.) included inside the document

a) Ken Ohnishi

b) middle school students

c) http://imgur.com/6XkVF

a light comic about the potentials of P=NP

a. Duon Ki

b. People who knows about P=NP problem

c. http://sphotos.ak.fbcdn.net/hphotos-ak-snc3/hs304.snc3/28805_1448476694529_1311543924_1259928_1563438_n.jpg

a. Robyn Short

b. Professor Evans

c. https://docs.google.com/a/virginia.edu/fileview?id=0B3blCSKEUiMTMTEzMWNjMjEtYzMwYy00YTE4LWJlMTUtN2NlNTBmYjI2ZGY1&hl=en

a. Navid Hosseini, John Koelling, Trung Tran, Ben Powell

b. Middle School students

c. http://www.youtube.com/watch?v=PeRRF3jrHbQ and also a themed cake to be consumed during class.

a. Richard Dodson – red8q@virginia.edu

b. College CS students who have a basic understanding of complexity theory.

c. http://people.virginia.edu/~red8q/CS%203102/OpenProblem/

a. Mohamed Amin

b. UPS director (who should be semi-knowledgeable of P=NP and turing machines)

c. http://docs.google.com/document/edit?id=1Lmm6W1-Dt0Moh8FYCsln2q_MAFkwvtd9LASgVPqDr1k&hl=en

Trygve Loken

https://docs.google.com/a/virginia.edu/Doc?docid=0AUoXLDfF4D26ZGN4ejg1NnZfNGQ4NTJrMmhi&hl=en

Resubmission on Link!

a. Adis Ljubovic

b. The target audience is people who are familiar with the P vs. NP problem and possibly familiar with Maximum Independent Set Problem(called INDEPENDENT-SET problem in comic).

https://doc-14-8k-docs.googleusercontent.com/docs/secure/rb76hs62dof3nkvdingba5cedl9ltjag/6cuel3qtkkepbpb78fssgrb0eit6ip1p/1273017600000/11502889419769978290/*/0BxF1vtXLmw7pZjE5ZTYyN2UtNjAxNC00NzZjLTg1OWMtZjU5YzdjMmVjNDBi?h=03491947472532422739

Footnote: The purpose of the cartoon is to demonstrate that people should be aware of when problems are NP complete, and that they should not waste their time on these problems that probably can’t be solved efficiently.

The problem in the comic is basically the Maximum Independent set problem, which is the problem of finding the largest set of vertices where no vertices are adjacent(connected by a single edge). Each person is represent by a vertex, and hatred between two people is represented by an edge(if two people get along, they do not have an edge connected them).