Difference between revisions of "User:Yg41"
| Line 2: | Line 2: | ||
*Making Personalized Medicine a Reality <ref> | *Making Personalized Medicine a Reality <ref> | ||
[http://www.genengnews.com/gen-articles/making-personalized-medicine-a-reality/2316/], Lisa A. Haile, Genetic Engineering and Biotechnology News, created 01 January 2008, accessed 3 September, 2012 (Engineer better medicines) </ref> | [http://www.genengnews.com/gen-articles/making-personalized-medicine-a-reality/2316/], Lisa A. Haile, Genetic Engineering and Biotechnology News, created 01 January 2008, accessed 3 September, 2012 (Engineer better medicines) </ref> | ||
| + | |||
| + | == My Favorite Matlab demo == | ||
| + | I play minesweeper all the time: in the morning, in the afternoon, when I'm doing my homework, etc. Most of the time, I can proceed from one square to another logically. Sometimes, I don't have enough information and have to risk blowing myself up. But, I've never seen a minesweeper configuration that didn't make any sense... or have I? (dun dun dun dunnnnn) Turns out that it's hard to know whether a certain minesweeper configuration can be solved or not. The minesweeper consistency problem, as it's more commonly known as, is an np problem, which means that it might be possible to solve it in polynomial time, but no one has come up with such an algorithm. Neither has anyone come up with a proof that shows this problem cannot be solved in polynomial time. Furthermore, this problem is np-complete, meaning that if an algorithm in polynomial time is found for this problem, that algorithm can also be modified to work for many other np problems. Yeah, so my favorite matlab demo was the minesweeper demo. | ||
| + | |||
[http://www.genengnews.com/gen-articles/making-personalized-medicine-a-reality/2316/], Lisa A. Haile, Genetic Engineering and Biotechnology News, created 01 January 2008, accessed 3 September, 2012 (Engineer better medicines) | [http://www.genengnews.com/gen-articles/making-personalized-medicine-a-reality/2316/], Lisa A. Haile, Genetic Engineering and Biotechnology News, created 01 January 2008, accessed 3 September, 2012 (Engineer better medicines) | ||
Latest revision as of 04:06, 4 September 2012
Articles I like
- Making Personalized Medicine a Reality [1]
My Favorite Matlab demo
I play minesweeper all the time: in the morning, in the afternoon, when I'm doing my homework, etc. Most of the time, I can proceed from one square to another logically. Sometimes, I don't have enough information and have to risk blowing myself up. But, I've never seen a minesweeper configuration that didn't make any sense... or have I? (dun dun dun dunnnnn) Turns out that it's hard to know whether a certain minesweeper configuration can be solved or not. The minesweeper consistency problem, as it's more commonly known as, is an np problem, which means that it might be possible to solve it in polynomial time, but no one has come up with such an algorithm. Neither has anyone come up with a proof that shows this problem cannot be solved in polynomial time. Furthermore, this problem is np-complete, meaning that if an algorithm in polynomial time is found for this problem, that algorithm can also be modified to work for many other np problems. Yeah, so my favorite matlab demo was the minesweeper demo.
[1], Lisa A. Haile, Genetic Engineering and Biotechnology News, created 01 January 2008, accessed 3 September, 2012 (Engineer better medicines)
