Academic Journal
Online, Computable and Punctual Structure Theory.
| Title: | Online, Computable and Punctual Structure Theory. |
|---|---|
| Authors: | Askes, Matthew1 (AUTHOR), Downey, Rod1 (AUTHOR) Rod.downey@vuw.ac.nz |
| Source: | Logic Journal of the IGPL. Dec2023, Vol. 31 Issue 6, p1251-1293. 43p. |
| Abstract: | Several papers (e.g. [ 7 , 23 , 42 ]) have recently sought to give general frameworks for online structures and algorithms ([ 4 ]), and seeking to connect, if only by analogy, online and computable structure theory. These initiatives build on earlier work on online colouring and other combinatorial algorithms by Bean [ 10 ], Kierstead, Trotter et al. [ 48 , 54 , 57 ] and others, as we discuss below. In this paper we will look at such frameworks and illustrate them with examples from the first author's MSc Thesis ([ 58 ]). In this thesis, Askes looks at online, adversarial online and strongly online algorithms and structures. Additionally, we prove some new theorems about online algorithms on graphs of bounded pathwidth as well as some new results on punctually 1-decidable structures. [ABSTRACT FROM AUTHOR] |
| Subject Terms: | Computable functions, Structural analysis (Engineering), Graph algorithms, Structural frames, Online algorithms |
| Copyright of Logic Journal of the IGPL is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| ISSN: | 13670751 |
| DOI: | 10.1093/jigpal/jzac065 |
| Database: | Business Source Complete |
Availability