Difference between revisions of "User:Jkr22"
| (One intermediate revision by the same user not shown) | |||
| Line 4: | Line 4: | ||
[http://www.wired.com/gadgetlab/2010/08/reverse-engineering-brain-kurzweil/ Reverse-Engineering of Human Brain Likely by 2030] , Priya Ganapati, Wired, created 16 August 2010, accessed 15 September 2013 (Reverse-engineer the brain) | [http://www.wired.com/gadgetlab/2010/08/reverse-engineering-brain-kurzweil/ Reverse-Engineering of Human Brain Likely by 2030] , Priya Ganapati, Wired, created 16 August 2010, accessed 15 September 2013 (Reverse-engineer the brain) | ||
| − | + | My first name is pronounced like the letter "J". My last name is pronounced "WRATH-in-uh-VAY-lew". | |
== My Favorite Demo == | == 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 | + | 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 pick a certain amount of random cities, and still find the shortest pathway between the cities in a circular path. This is also my favorite demo because it seems very practical as well as very complicated. |
Latest revision as of 15:56, 17 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.
Reverse-Engineering of Human Brain Likely by 2030 , Priya Ganapati, Wired, created 16 August 2010, accessed 15 September 2013 (Reverse-engineer the brain)
My first name is pronounced like the letter "J". My last name is pronounced "WRATH-in-uh-VAY-lew".
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 pick a certain amount of random cities, and still find the shortest pathway between the cities in a circular path. This is also my favorite demo because it seems very practical as well as very complicated.
