首页|Recent Findings from Ulm University Provides New Insights into Turing Machines ( Countability Constraints In Order-theoretic Approaches To Computability)
Recent Findings from Ulm University Provides New Insights into Turing Machines ( Countability Constraints In Order-theoretic Approaches To Computability)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
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."
UlmGermanyEuropeEmerging Technolog iesMachine LearningTuring MachinesUlm University
NETL
NSTL
