走向通过可实现性的复杂性理论
Towards a Complexity-through-Realisability Theory
摘要：
我们解释了如何在线性逻辑的可实现性模型领域的最新发展-或互动的几何-和隐式计算复杂性可以导致一个新的方法隐式计算复杂性。这种基于语义的方法应统一适用于各种计算范式，并使新的数学方法和工具的使用，以解决问题的计算复杂性。本文提供了背景，动机和前景的复杂性通过可实现性理论的发展，并说明了它与最近的结果。
英文摘要：
We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity. This semantic-based approach should apply uniformly to various computational paradigms, and enable the use of new mathematical methods and tools to attack problem in computational complexity. This paper provides the background, motivations and perspectives of this complexity-through-realisability theory to be developed, and illustrates it with recent results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
