Revision [1256]

Last edited on 2010-01-07 15:37:18 by FritsRincker
Additions:
[[info@sunreign.com Feedback]]

Revision [1151]

Edited on 2010-01-04 16:15:35 by FritsRincker
Additions:
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.
Deletions:
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.

Revision [1149]

Edited on 2010-01-04 16:04:09 by FritsRincker
Additions:
The Deutsche Bank offers a overal counter [[http://www.dbcca.com/dbcca/EN/ here]].
Deletions:
The Deutsche Bank offers a overal counter [[http://www.dbcca.com/dbcca/EN/what-you-can-do/downloadable_widget.jsp here]].

Revision [1148]

Edited on 2010-01-04 15:53:51 by FritsRincker
Additions:
""""

Revision [1147]

Edited on 2010-01-04 15:52:58 by FritsRincker
Additions:
The Deutsche Bank offers a overal counter [[http://www.dbcca.com/dbcca/EN/what-you-can-do/downloadable_widget.jsp here]].

Revision [1146]

Edited on 2010-01-04 15:45:27 by FritsRincker
Additions:
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.
Deletions:
Quantum computing has risks, just like nuclear power 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.

Revision [1145]

Edited on 2010-01-04 15:45:06 by FritsRincker
Additions:
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 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.
Deletions:
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). Quantum computing has risks, just like nuclear power 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.

Revision [1144]

Edited on 2010-01-04 15:43:52 by FritsRincker
Additions:
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). Quantum computing has risks, just like nuclear power 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.
Deletions:
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). Quantum computing has risks, just like nuclear power 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.

Revision [1143]

Edited on 2010-01-04 15:43:30 by FritsRincker
Additions:
""""

Revision [1142]

Edited on 2010-01-04 15:41:49 by FritsRincker
Additions:
[[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).
Deletions:
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).

Revision [1141]

Edited on 2010-01-04 15:38:33 by FritsRincker
Additions:
[[http://www.sunreign.com/info/GoodIdeas Back to Index]]
[[http://www.sunreign.com/info/GoodIdeas015 Next]]

Revision [1140]

Edited on 2010-01-04 15:36:05 by FritsRincker
Additions:
====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.

Revision [1139]

Edited on 2010-01-04 15:33:55 by FritsRincker
Additions:
=====Fasttrack Quantum Computing=====
Deletions:
=====FastTrack Quantum Computing=====

Revision [1138]

Edited on 2010-01-04 15:33:42 by FritsRincker
Additions:
[[http://www.dwavesys.com/ d-wave systems]] is working on this problem.

Revision [1137]

The oldest known version of this page was created on 2010-01-04 15:30:19 by FritsRincker
Valid XHTML 1.0 Transitional :: Valid CSS :: Powered by WikkaWiki
Page was generated in 0.5024 seconds