Decision times of infinite computations

11/10/2020
by   Merlin Carl, et al.
0

The decision time of an infinite time algorithm is the supremum of its halting times over all real inputs. The decision time of a set of reals is the least decision time of an algorithm that decides the set; semidecision times of semidecidable sets are defined similary. It is not hard to see that ω_1 is the maximal decision time of sets of reals. Our main results determine the supremum of countable decision times as σ and that of countable semidecision times as τ, where σ and τ denote the suprema of Σ_1- and Σ_2-definable ordinals, respectively, over L_ω_1. We further compute analogous suprema for singletons.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2018

Minsum k-Sink Problem on Path Networks

We consider the problem of locating a set of k sinks on a path network w...
research
01/09/2018

Stabbing pairwise intersecting disks by five points

We present an O(n) expected time algorithm and an O(n n) deterministic ...
research
11/13/2021

Transformation and simulation for a generalised queuing problem using a G/G/n/G/+ queuing model

We examine a generalised queuing model which we call the G/G/n/G/+ model...
research
04/13/2023

The Longest Subsequence-Repeated Subsequence Problem

Motivated by computing duplication patterns in sequences, a new fundamen...
research
10/22/2020

Approximating the Minimal Lookahead Needed to Win Infinite Games

We present an exponential-time algorithm approximating the minimal looka...
research
02/09/2019

Approximation of subsets of natural numbers by c.e. sets

The approximation of natural numbers subsets has always been one of the ...
research
05/16/2017

Real-Time Adaptive Image Compression

We present a machine learning-based approach to lossy image compression ...

Please sign up or login with your details

Forgot password? Click here to reset