Formatting code for GoodIdeas014
[[http://www.sunreign.com/info/GoodIdeas Back to Index]]
[[http://www.sunreign.com/info/GoodIdeas015 Next]]
=====Fasttrack Quantum Computing=====
[[http://en.wikipedia.org/wiki/Quantum_computer Quantum computers]] are capable of running algorithms in a single step that conventional computers require billions of years to solve. This is because quantum represented problems generate their solutions without requiring time (just like our 'present' generates its next 'present' without requiring time).
""<img src='http://www.physics.utoronto.ca/~john/john/QuantumComputing.jpg'>""
Especially so called [[http://en.wikipedia.org/wiki/NP-complete NP-complete]] problems are crackable. These class of problems (like the so called 'traveling salesman' problem) require you to take step before you can find out the optimal route (because each step changes which possible steps can still follow). Many problems are NP-complete, like encryption and weather algoriths (which is kind of why they are 'problem').
Quantum computing has risks, just like nuclear power f.i. in the sense that a military application is likely to be hard to beat. In domestic applications however it promises to significantly cut energy consumption for searches by reducing the necessary steps.
[[http://www.dwavesys.com/ d-wave systems]] is working on this problem.
====Online carbon counter====
In the mean time one might want to introduce a live carbon emission counter. The internet is hugely important in commerce, but also 2% of the problem. Below is an example, which is not that usefull but still indicates the rapid increase of greenhousegasses released. Most having a halflife of millions of years.
""<img src='http://www.dbcca.com/dbcca/EN/_img/widget.gif'>""
The Deutsche Bank offers a overal counter [[http://www.dbcca.com/dbcca/EN/ here]].
[[info@sunreign.com Feedback]]
[[http://www.sunreign.com/info/GoodIdeas015 Next]]
=====Fasttrack Quantum Computing=====
[[http://en.wikipedia.org/wiki/Quantum_computer Quantum computers]] are capable of running algorithms in a single step that conventional computers require billions of years to solve. This is because quantum represented problems generate their solutions without requiring time (just like our 'present' generates its next 'present' without requiring time).
""<img src='http://www.physics.utoronto.ca/~john/john/QuantumComputing.jpg'>""
Especially so called [[http://en.wikipedia.org/wiki/NP-complete NP-complete]] problems are crackable. These class of problems (like the so called 'traveling salesman' problem) require you to take step before you can find out the optimal route (because each step changes which possible steps can still follow). Many problems are NP-complete, like encryption and weather algoriths (which is kind of why they are 'problem').
Quantum computing has risks, just like nuclear power f.i. in the sense that a military application is likely to be hard to beat. In domestic applications however it promises to significantly cut energy consumption for searches by reducing the necessary steps.
[[http://www.dwavesys.com/ d-wave systems]] is working on this problem.
====Online carbon counter====
In the mean time one might want to introduce a live carbon emission counter. The internet is hugely important in commerce, but also 2% of the problem. Below is an example, which is not that usefull but still indicates the rapid increase of greenhousegasses released. Most having a halflife of millions of years.
""<img src='http://www.dbcca.com/dbcca/EN/_img/widget.gif'>""
The Deutsche Bank offers a overal counter [[http://www.dbcca.com/dbcca/EN/ here]].
[[info@sunreign.com Feedback]]
