- December, 2023
- March, 2023
- November, 2022
- September, 2022
- August, 2022
- July, 2022
- March, 2022
- December, 2021
- November, 2021
- August, 2021
- March, 2021
- February, 2021
- December, 2020
- November, 2020
- October, 2020
- September, 2020
- August, 2020
- May, 2020
- April, 2020
- March, 2020
- January, 2020
- December, 2019
- August, 2019
- May, 2019
- August, 2018
- May, 2018
- March, 2018
- June, 2016
- March, 2016
- September, 2015
- August, 2015
- May, 2015
- March, 2015
- February, 2015
- January, 2015
- November, 2014
- October, 2014
- September, 2014
- August, 2014
- July, 2014
- May, 2014
- March, 2014
- February, 2014
- December, 2013
- November, 2013
- October, 2013
- September, 2013
- July, 2013
- June, 2013
- May, 2013
- March, 2013
- February, 2013
- January, 2013
- December, 2012
- November, 2012
- October, 2012
- September, 2012
- August, 2012
- April, 2012
- March, 2012
- February, 2012
- January, 2012
- December, 2011
- November, 2011
- October, 2011
- September, 2011
- August, 2011
- July, 2011
- June, 2011
- May, 2011
- April, 2011
- March, 2011
- February, 2011
- January, 2011
- December, 2010
- November, 2010
- October, 2010
- September, 2010
- August, 2010
- June, 2010
- May, 2010
- April, 2010
- March, 2010
- February, 2010
- January, 2010
- December, 2009
- November, 2009
- October, 2009
- September, 2009
- August, 2009
- July, 2009
- June, 2009
- May, 2009
- April, 2009
- March, 2009
- February, 2009
- January, 2009
- December, 2008
- November, 2008
- October, 2008
- September, 2008
- August, 2008
- July, 2008
- May, 2008
- April, 2008
- March, 2008
- February, 2008
- January, 2008
- December, 2007
- November, 2007
- October, 2007
- September, 2007
- August, 2007
- July, 2007
- June, 2007
- May, 2007
- April, 2007
- March, 2007
- February, 2007
- January, 2007
- December, 2006
- November, 2006
- October, 2006
- September, 2006
- August, 2006
- July, 2006
- June, 2006
- May, 2006
- April, 2006
- March, 2006
- February, 2006
- January, 2006
- December, 2005
- November, 2005
- October, 2005
- September, 2005
- August, 2005
- June, 2005
- May, 2005
- April, 2005
- March, 2005
- February, 2005
No comment yet
计算的未来是什么?
计算的未来是量子。
O(N)次的算法复杂度还是太高了,若是量子,恐怕就能够到O(1)吧。
我们现在的计算,多还是非并行的,即使是并行的,也不大可能组成亿亿台电脑同时运算的庞大并行系统。串行导致的结果是,Chain Cascade算法检测一个物品是20fps,相当高的速度。而检测6个物品就到了4fps,若更多的话运算量成倍增加,无法想象。
考虑黑白棋的66完全解,再考虑为什么88还没有完全解。因为这里时间复杂度的上升是指数级别的O(2^N)。
有人告诉我,解决这一切的方法是量子计算机。传说中能够将复杂度降一个数量级的方法。
我想,这是一个好方法,提高并行的能力,就能够解决一切问题,不能够等到20G的PX的出现,就只有等待更漫长的量子计算机的研发了。
Related Posts
- 05 Dec 2023, The Phase-Change in User-Faced Computing
- 28 Mar 2023, The Dangerous Territory of Pre-GPT4
- 08 Nov 2022, Stretch iPhone to its Limit, a 2GiB Model that can Draw Everything in Your Pocket
- 02 Sep 2022, 5 More Implementation Details of PPO and SAC
- 16 Aug 2022, Openness Trumps Profit-Seeking, What We can Learn from a Decade of AI Renaissance
- 28 Jul 2022, Fun with Motion-JPEG, Jupyter Notebook and How to Stream GUI and Animations in the Browser
- 22 Mar 2022, Gifting Another 100x More Computations to the Physical World
- 17 Mar 2022, Think Big and Small
- 14 Dec 2021, Research Notes on Humanoid Robots
- 08 Nov 2021, The Lesson from Private Ski Lesson, or How Money Cannot Buy Performance
blog comments powered by Disqus