程序所携带的关于它们所计算的对象的信息
On the information carried by programs about the objects they compute
摘要：
在可计算性理论和可计算分析中，有限程序可以计算无限对象。通过任何程序呈现一个可计算对象，至少提供了与呈现对象本身一样多的信息，写在无限磁带上。计划提供哪些额外信息？我们的特点是这个额外的信息是任何上限的Kolmogorov复杂性的对象。因此，我们确定了马尔可夫可计算性和类型2可计算性之间的确切关系。然后，我们使用这种关系，得到几个结果表征的计算和拓扑结构的马尔可夫半判定集。
英文摘要：
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an infinite tape. What additional information do programs provide? We characterize this additional information to be any upper bound on the Kolmogorov complexity of the object. Hence we identify the exact relationship between Markov-computability and Type-2-computability. We then use this relationship to obtain several results characterizing the computational and topological structure of Markov-semidecidable sets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
