Bounding lemmata for non-deterministic halting times of transfinite Turing machines

被引：1
|
作者：
Welch, Philip D. [1 ]
机构：
[1] Univ Bristol, Sch Math, Bristol BS8 1TW, Avon, England
来源：
THEORETICAL COMPUTER SCIENCE | 2008年 / 394卷 / 03期
基金：
英国工程与自然科学研究理事会;
关键词：
D O I：
10.1016/j.tcs.2007.12.014
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We use the methods of descriptive set theory and generalized recursion theory to prove various Bounding Lemmata that contribute to a body of results on halting times of non-deterministic infinite time Turing machine computations. In particular we observe that there is a Uniform Bounding Lemma which states that if any total algorithm halts before the first ordinal admissible in the input x, then there is a recursive ordinal gamma by which the algorithm halts on all inputs. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：223 / 228
页数：6
相关论文
共 22 条
  • [1] Non-deterministic halting times for Hamkins-Kidder turing machines
    Welch, P. D.
    LOGICAL APPROACHES TO COMPTATIONAL BARRIERS, PROCEEDINGS, 2006, 3988 : 571 - 574
  • [2] Optical Designs for Non-deterministic Turing Machines (Extended Abstract)
    Dolev, Shlomi
    Nir, Yuval
    OPTICAL SUPERCOMPUTING, PROCEEDINGS, 2009, 5882 : 47 - 55
  • [3] Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
    Welch, P. D.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (4-5) : 426 - 442
  • [4] Learning Abstracted Non-deterministic Finite State Machines
    Pferscher, Andrea
    Aichernig, Bernhard K.
    TESTING SOFTWARE AND SYSTEMS, ICTSS 2020, 2020, 12543 : 52 - 69
  • [5] Distinguing Non-deterministic Timed Finite State Machines
    Gromov, Maxim
    El-Fakih, Khaled
    Shabaldina, Natalia
    Yevtushenko, Nina
    FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5522 : 137 - +
  • [6] A Logic for Non-deterministic Parallel Abstract State Machines
    Ferrarotti, Flavio
    Schewe, Klaus-Dieter
    Tec, Loredana
    Wang, Qing
    FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS (FOIKS 2016), 2016, 9616 : 334 - 354
  • [7] Impact of Non-Deterministic Software Execution Times in SmartGrid Applications
    Smith, David
    Olariu, Cristian
    Perry, Philip
    Murphy, John
    2015 26TH IRISH SIGNALS AND SYSTEMS CONFERENCE (ISSC), 2015,
  • [8] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Ferrarotti, Flavio
    Schewe, Klaus-Dieter
    Tec, Loredana
    Wang, Qing
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2018, 83 (3-4) : 321 - 349
  • [9] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Flavio Ferrarotti
    Klaus-Dieter Schewe
    Loredana Tec
    Qing Wang
    Annals of Mathematics and Artificial Intelligence, 2018, 83 : 321 - 349
  • [10] The physical Church-Turing thesis and non-deterministic computation over the real numbers
    Dowek, Gilles
    PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2012, 370 (1971): : 3349 - 3358
123