Scholarlink

Let S be the set of computing problems that can be solved by a Turing machine. This chapter introduces how to further classify this set using complexity as a new characteristic based on computational resources. Complexity can be defined in many ways. As a consequence, a significant number of subsets of solvable computing problems can be derived from the set S.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Computational Complexity

  • 章节

  • 发表日期：

    2025年

查看全文
  • Fuchun Guo,
  • Willy Susilo,
  • Khoa Nguyen,
  • Xiaofeng Chen,
  • Zhen Zhao

摘要

Let S be the set of computing problems that can be solved by a Turing machine. This chapter introduces how to further classify this set using complexity as a new characteristic based on computational resources. Complexity can be defined in many ways. As a consequence, a significant number of subsets of solvable computing problems can be derived from the set S.