ω-Computations on Turing machines

Highly Undecidable Problems For Infinite Computations

“…The above acceptance condition is denoted 1 ′ -acceptance in [CG78b]. Another usual acceptance condition is the now called Büchi acceptance condition which is also denoted 2-acceptance in [CG78b].…”

“…Another usual acceptance condition is the now called Büchi acceptance condition which is also denoted 2-acceptance in [CG78b]. We just now recall its definition.…”

“…Recall that Cohen and Gold proved in [CG78b,Theorem 8.6] that one can effectively construct, from a given non deterministic Turing machine, another equivalent (i.e., accepting the same ω-language) non deterministic Turing machine, equipped with the same kind of acceptance condition, and in which every run is complete non oscillating.…”

Decision problems for Turing machines

“…Other usual acceptance conditions are the now called Büchi or Muller acceptance conditions, respectively denoted 2-acceptance and 3-acceptance in [CG78]. Cohen and Gold proved the following result in [CG78, Theorem 8.2].…”

“…The above acceptance condition is denoted 1 ′ -acceptance in [CG78]. Other usual acceptance conditions are the now called Büchi or Muller acceptance conditions, respectively denoted 2-acceptance and 3-acceptance in [CG78].…”