FOUNDATIONS OF ONLINE STRUCTURE THEORY

@article{Bazhenov2019FOUNDATIONSOO,
  title={FOUNDATIONS OF ONLINE STRUCTURE THEORY},
  author={Nikolay Bazhenov and Rodney G. Downey and Iskander Sh. Kalimullin and Alexander G. Melnikov},
  journal={The Bulletin of Symbolic Logic},
  year={2019},
  volume={25},
  pages={141 - 181}
}
Abstract The survey contains a detailed discussion of methods and results in the new emerging area of online “punctual” structure theory. We also state several open problems. 
Foundations of Online Structure Theory II: The Operator Approach
TLDR
A view that online algorithms can be viewed as a sub-area of computable analysis is begun, and a new framework for online structure theory is introduced.
A structure of punctual dimension two
This paper contributes to the general program which aims to eliminate an unbounded search from proofs and procedures in computable structure theory. A countable structure in a finite language is
Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings
TLDR
Read Mapping Through Hardware/Software Co-design Through hardware/ software co-design is explored through hardware-based and software-based approaches.
EFFECTIVELY COMPACT SPACES
We give a systematic technical exposition of the foundations of the theory of e↵ectively compact metric spaces. We discover several new characterizations of e↵ective compactness and apply these
To reorient is easier than to orient: an on-line algorithm for reorientation of graphs
We define an on-line (incremental) algorithm that, given a (possibly infinite) pseudo-transitive oriented graph, produces a transitive reorientation. This implies that a theorem of Ghouila-Houri is
Semilattices of Punctual Numberings
TLDR
This paper aims to classify the algorithmic complexity of numberings, i.e. uniform enumerations for families of computably enumerable sets, and the reducibility, induced by Turing computable functions, among these numberings.
Non-density in punctual computability
...
...

References

SHOWING 1-10 OF 87 REFERENCES
Some New Directions and Questions in Parameterized Complexity
TLDR
This paper is looking at some current investigations aimed towards applying ideas of parameterized complexity in the field of online model theory, and concentrating on some open questions.
Word processing in groups
TLDR
This study in combinatorial group theory introduces the concept of automatic groups and is of interest to mathematicians and computer scientists and includes open problems that will dominate the research for years to come.
The Diversity of Categoricity Without Delay
We suggest several new ways to compare fully primitive recursive presentations of a structure. Properties of this kind have never been seen in computable structure theory. We prove that these new
Algebraic structures computable without delay
Online computation and competitive analysis
TLDR
This book discusses competitive analysis and decision making under uncertainty in the context of the k-server problem, which involves randomized algorithms in order to solve the problem of paging.
Computable Analysis: An Introduction
  • K. Weihrauch
  • Education
    Texts in Theoretical Computer Science. An EATCS Series
  • 2000
TLDR
This book provides a solid fundament for studying various aspects of computability and complexity in analysis and is written in a style suitable for graduate-level and senior students in computer science and mathematics.
Polynomial-Time versus Recursive Models
Uniformity in Computable Structure Theory
TLDR
This work considers and compares two different notions of uniformity, previously studied by Kudinov and by Ventsov, and investigates the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity and intrinsic computability.
...
...