Explore >> Select a destination
|
You are here 
|
zerocounts.net | ||
| | | | |
www.sifter.com.au
|
|
| | | | | All the coverage of Metroid Prime 4: Beyond by the SIFTER team. Gameplay, podcast interviews and more. | |
| | | | |
www.jeremykun.com
|
|
| | | | | Problem: Prove that generalized versions of Mario Brothers, Metroid, Donkey Kong, Pokemon, and Legend of Zelda are NP-hard. Solution: http://arxiv.org/abs/1203.1895v1 Discussion: Three researchers (including Erik Demaine, a computer science professor at MIT famous for his work with the mathematics of origami) recently finished a paper giving the complexity of a number of classic Nintendo games (the ones I loved to play). All are proven NP-hard, some are shown to be NP-complete, and some are PSPACE-complete. | |
| | | | |
shellsharks.com
|
|
| | | | | Cybersecurity Research and More | |
| | | | |
blog.danielpietzsch.com
|
|
| | | Why I don't want to upgrade my Mac right now I'm using an early 2011 15 inch MacBook Pro. Still! It's now almost eight years old. And it's plagued by that issue with its discrete graphics card. After... | ||
