摘要
由一名新闻记者-机器人与机器学习的工作人员新闻编辑每日新闻-图灵机的新研究是一篇报道的主题。根据NewsRx J Ournalists在德国乌尔姆的新闻报道，研究表明：“不可数集上的可计算性没有标准的形式化，不像图灵机给出的可计算性。在这些集合中定义可计算性的一些方法依赖于有序理论结构，将这些概念从图灵机转化为不可数集的速度。”这项研究的财政支持来自欧洲研究理事会(ERC)。新闻记者从乌尔姆大学的研究中得到一句话：“由于这些机器是这些方法中可计算性的基线，所以对有序结构的可数性限制是基本的。这里，我们展示了可计算性的序理论中常用的可数性限制与一些更常见的序论可数性限制之间的几个关系。”"类似于序密度性质和序结构的多效用函数刻画."
Abstract
By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News Daily News-New research on Turing Machines is the subject of a report. According to news reporting from Ulm, Germany, by NewsRx j ournalists, research stated, "Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theo retic structures to translate such notions from Turing machines to uncountable s paces." Financial support for this research came from European Research Council (ERC). The news correspondents obtained a quote from the research from Ulm University, "Since these machines are used as a baseline for computability in these approach es, countability restrictions on the ordered structures are fundamental. Here, w e show several relations between the usual countability restrictions in order-th eoretic theories of computability and some more common order-theoretic countabil ity constraints, like order density properties and functional characterizations of the order structure in terms of multi-utilities."
NETL
NSTL