交互行为的计算复杂性
Computational Complexity of Interactive Behaviors
摘要：
计算复杂性理论关注函数，因此研究其交互行为被简化为简单的问题/回答模式的程序。我们提出了一个更广泛的理论，其最终目标是表达和分析完全一般的互动行为的内在困难。在这种程度上，我们使用并发理论的标准工具，包括标记的转换系统（形式化行为）及其异步扩展（提供因果关系信息）。行为是通过执行类似CCS的进程的多处理器机器来实现的。由此产生的理论被证明是与经典定义一致的：当我们限制到功能行为（即，问题/回答模式），我们恢复几个标准的计算复杂性类。
英文摘要：
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing the intrinsic difficulty of fully general interactive behaviors. To this extent, we use standard tools from concurrency theory, including labelled transition systems (formalizing behaviors) and their asynchronous extension (providing causality information). Behaviors are implemented by means of a multiprocessor machine executing CCS-like processes. The resulting theory is shown to be consistent with the classical definitions: when we restrict to functional behaviors (i.e., question/answer patterns), we recover several standard computational complexity classes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
