通过Delta 2集的变化来校准其复杂性
Calibrating the complexity of Delta 2 sets via their changes
摘要：
Delta 2集合的计算复杂性将由其任何可计算近似所需的变化量来校准。首先，我们研究了Martin-Loef随机集，其中我们量化了初始段的变化。第二，我们看看C。集合，其中我们通过服从费用函数来量化总体变化量。最后，我们将这两种设置结合起来。这些讨论导致了关于复杂性和变化之间关系的三个基本原则。
英文摘要：
The computational complexity of a Delta 2 set will be calibrated by the amount of changes needed for any of its computable approximations. Firstly, we study Martin-Loef random sets, where we quantify the changes of initial segments. Secondly, we look at c.e. sets, where we quantify the overall amount of changes by obedience to cost functions. Finally, we combine the two settings. The discussions lead to three basic principles on how complexity and changes relate.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
