Difference between revisions of "User:Jkr22"
| Line 3: | Line 3: | ||
[http://www.wired.com/gadgetlab/2010/08/reverse-engineering-brain-kurzweil/ link title] , Priya Ganapathi, Wired, created August 16, 2010, accessed September 15, 2013 (Grand Challenge) | [http://www.wired.com/gadgetlab/2010/08/reverse-engineering-brain-kurzweil/ link title] , Priya Ganapathi, Wired, created August 16, 2010, accessed September 15, 2013 (Grand Challenge) | ||
| + | |||
| + | |||
| + | == My Favorite Demo == | ||
My favorite demo is the Traveling Salesman Demo. I really enjoy this demo because it changes every time it is run. It is really interesting how the program is able to randomly pick a certain amount of cities, and still find the shortest pathway between the cities while also creating a closed loop between the cities. This is also my favorite demo because it seems very practical as well as very complicated. | My favorite demo is the Traveling Salesman Demo. I really enjoy this demo because it changes every time it is run. It is really interesting how the program is able to randomly pick a certain amount of cities, and still find the shortest pathway between the cities while also creating a closed loop between the cities. This is also my favorite demo because it seems very practical as well as very complicated. | ||
Revision as of 02:20, 16 September 2013
Hello, my name is Jay, and I am a freshman at Duke University. I really enjoy playing tennis, watching TV shows (such as How I Met Your Mother and Sherlock), and playing card games. I am interested in philosophy and enjoy debating about different philosophical theories. I am looking forward to spending my next four years at Duke.
link title , Priya Ganapathi, Wired, created August 16, 2010, accessed September 15, 2013 (Grand Challenge)
My Favorite Demo
My favorite demo is the Traveling Salesman Demo. I really enjoy this demo because it changes every time it is run. It is really interesting how the program is able to randomly pick a certain amount of cities, and still find the shortest pathway between the cities while also creating a closed loop between the cities. This is also my favorite demo because it seems very practical as well as very complicated.
