咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 interacting vari...
  • 1 篇 mathematical con...
  • 1 篇 finiteness condi...
  • 1 篇 random access ma...
  • 1 篇 unbounded space
  • 1 篇 simulation
  • 1 篇 models of comput...
  • 1 篇 parallel random ...
  • 1 篇 communication wi...
  • 1 篇 unbounded time
  • 1 篇 general-purpose ...
  • 1 篇 universal comput...
  • 1 篇 time-varying com...
  • 1 篇 uncertain time c...
  • 1 篇 nonuniversality ...
  • 1 篇 rank-varying com...
  • 1 篇 time unit
  • 1 篇 time-varying var...
  • 1 篇 finite and fixed...
  • 1 篇 turing machine

机构

  • 1 篇 queens univ dept...
  • 1 篇 queens univ sch ...
  • 1 篇 queens univ dept...

作者

  • 1 篇 akl selim g.
  • 1 篇 salay nancy

语言

  • 1 篇 英文
检索条件"主题词=time-varying computational complexity"
1 条 记 录,以下是1-10 订阅
排序:
On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism
收藏 引用
INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 2015年 第3-4期11卷 283-297页
作者: Akl, Selim G. Salay, Nancy Queens Univ Sch Comp Kingston ON K7L 3N6 Canada Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada Queens Univ Dept Philosophy Kingston ON K7L 3N6 Canada
We present a simple example that disproves the universality principle. Unlike previous counter-examples to computational universality, it does not rely on extraneous phenomena, such as the availability of input variab... 详细信息
来源: 评论