DeepAI AI Chat
Log In Sign Up

Finding descending sequences through ill-founded linear orders

by   Jun Le Goh, et al.

In this work we investigate the Weihrauch degree of the problem 𝖣𝖲 of finding an infinite descending sequence through a given ill-founded linear order, which is shared by the problem 𝖑𝖲 of finding a bad sequence through a given non-well quasi-order. We show that 𝖣𝖲, despite being hard to solve (it has computable inputs with no hyperarithmetic solution), is rather weak in terms of uniform computational strength. To make the latter precise, we introduce the notion of the deterministic part of a Weihrauch degree. We then generalize 𝖣𝖲 and 𝖑𝖲 by considering Ξ“-presented orders, where Ξ“ is a Borel pointclass or Ξ”^1_1, Ξ£^1_1, Ξ ^1_1. We study the obtained 𝖣𝖲-hierarchy and 𝖑𝖲-hierarchy of problems in comparison with the (effective) Baire hierarchy and show that they do not collapse at any finite level.


page 1

page 2

page 3

page 4

βˆ™ 10/29/2019

Effective Wadge Hierarchy in Computable Quasi-Polish Spaces

We define and study an effective version of the Wadge hierarchy in compu...
βˆ™ 12/20/2013

Generating Shortest Synchronizing Sequences using Answer Set Programming

For a finite state automaton, a synchronizing sequence is an input seque...
βˆ™ 02/22/2022

The Open Problem of Finding a General Classification of Geodetic Graphs

This note describes some open problems that can be examined with the pur...
βˆ™ 08/11/2017

Normalized Information Distance and the Oscillation Hierarchy

We study the complexity of approximations to the normalized information ...
βˆ™ 03/11/2018

A Linear Algebraic Approach to Subfield Subcodes of GRS Codes

The problem of finding subfield subcodes of generalized Reed-Solomon (GR...
βˆ™ 04/07/2021

Optimal fire allocation in a combat model of mixed NCW type

In this work, we introduce a nonlinear Lanchester model of NCW-type and ...