Difference between revisions of "User:Jstranne"
| Line 11: | Line 11: | ||
== Grand Challenge for Engineering == | == Grand Challenge for Engineering == | ||
* [https://www.wired.com/2010/08/reverse-engineering-brain-kurzweil Reverse Engineering of Human Brain Likely by 2030, Expert Predicts], Priya Ganapait, Wired, updated August 16 2010, accessed 21 September 2017 (Reverse-engineer the Brain) | * [https://www.wired.com/2010/08/reverse-engineering-brain-kurzweil Reverse Engineering of Human Brain Likely by 2030, Expert Predicts], Priya Ganapait, Wired, updated August 16 2010, accessed 21 September 2017 (Reverse-engineer the Brain) | ||
| + | == MATLAB Demonstrations == | ||
| + | The MATLAB Demonstration that I found to be most interesting was the traveling salesman demonstration. The traveling salesman problem essentially is a program that is designed to find the shortest possible path in order to travel to a given set of cities (or locations). I found this to be interesting because I took a computer science class during my junior year of high school in which we worked on this problem. | ||
Revision as of 00:14, 22 September 2017
Contents
About Me
My name is Jason Stranne and I am a freshman at Duke University. I am from McLean Virgina, a town in the suburbs of D.C. I went to Thomas Jefferson High School where I was also a member of the varsity soccer team. I am planning on studying biomedical engineering at Duke and am considering a computer science minor.
My Classes
During the 2017 fall semester I am taking: Chemistry 201: Organic Chemistry Math 212: Multi-variable Calculus EGR103: Computational Methods in Engineering EVANTH 101: Evolutionary Anthropology
Name Pronunciation
Jason Stranne is pronounced like Jay-Sun Str-an-ee.
Grand Challenge for Engineering
- Reverse Engineering of Human Brain Likely by 2030, Expert Predicts, Priya Ganapait, Wired, updated August 16 2010, accessed 21 September 2017 (Reverse-engineer the Brain)
MATLAB Demonstrations
The MATLAB Demonstration that I found to be most interesting was the traveling salesman demonstration. The traveling salesman problem essentially is a program that is designed to find the shortest possible path in order to travel to a given set of cities (or locations). I found this to be interesting because I took a computer science class during my junior year of high school in which we worked on this problem.
