• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>New aspects of systems theory and scientific computation >Apples and Oranges? Comparing Unconventional Computers
【24h】

Apples and Oranges? Comparing Unconventional Computers

机译：苹果和橘子？比较非常规计算机

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Complexity theorists routinely compare-via the pre-ordering induced by asymptotic O-notation-the efficiency of computers so as to ascertain which offers the most efficient solution to a given problem. Tacit in this statement, however, is that the computers conform to a standard computational model: that is, they are Turing machines, random-access machines or similar. However, whereas meaningful comparison between these conventional computers is well understood and correctly practised, that of non-standard machines (such as quantum, chemical and optical computers) is rarely even attempted and, where it is, is often attempted under the typically false assumption that the conventional-computing approach to comparison is adequate in the unconventional-computing case. We discuss in the present paper a computational-model-independent approach to the comparison of computers' complexity (and define the corresponding complexity classes). Notably, the approach allows meaningful comparison between an unconventional computer and an existing, digital-computer benchmark that solves the same problem.
机译：复杂性理论家通常通过渐近O标记引起的预排序来比较计算机的效率，从而确定哪种方法可以为给定问题提供最有效的解决方案。然而，这句话的默认是计算机符合标准的计算模型：也就是说，它们是图灵机，随机存取机或类似计算机。但是，尽管可以很好地理解和正确实践这些常规计算机之间的有意义的比较，但很少尝试使用非标准机器（例如量子，化学和光学计算机），并且通常是在错误的假设下进行尝试的。在非常规计算情况下，常规计算方法进行比较就足够了。我们在本文中讨论了一种与计算模型无关的方法来比较计算机的复杂度（并定义了相应的复杂度类）。值得注意的是，该方法可以在非常规计算机与解决相同问题的现有数字计算机基准之间进行有意义的比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号