scholarly journals Foundations of Online Structure Theory II: The Operator Approach

2021 ◽  
Vol Volume 17, Issue 3 ◽  
Author(s):  
Rod Downey ◽  
Alexander Melnikov ◽  
Keng Meng Ng

We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow the input to be a countable object of an arbitrary complexity. We give a new framework which (i) ties online algorithms with computable analysis, (ii) shows how to use modifications of notions from computable analysis, such as Weihrauch reducibility, to analyse finite but uniform combinatorics, (iii) show how to finitize reverse mathematics to suggest a fine structure of finite analogs of infinite combinatorial problems, and (iv) see how similar ideas can be amalgamated from areas such as EX-learning, computable analysis, distributed computing and the like. One of the key ideas is that online algorithms can be viewed as a sub-area of computable analysis. Conversely, we also get an enrichment of computable analysis from classical online algorithms.

2017 ◽  
pp. 225-302
Author(s):  
Keith J. Devlin

2019 ◽  
Vol 27 (3) ◽  
pp. 381-439
Author(s):  
Walter Dean

Abstract Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof.


One of the earliest successes of classical quantum dynamics in a field where ordinary methods had proved inadequate was the solution, by Schwarzschild and Epstein, of the problem of the hydrogen atom in an electric field. It was shown by them that under the influence of the electric field each of the energy levels in which the unperturbed atom can exist on Bohr’s original theory breaks up into a number of equidistant levels whose separation is proportional to the strength of the field. Consequently, each of the Balmer lines splits into a number of components with separations which are integral multiples of the smallest separation. The substitution of the dynamics of special relativity for classical dynamics in the problem of the unperturbed hydrogen atom led Sommerfeld to his well-known theory of the fine-structure of the levels; thus, in the absence of external fields, the state n = 1 ( n = 2 in the old notation) is found to consist of two levels very close together, and n = 2 of three, so that the line H α of the Balmer series, which arises from a transition between these states, has six fine-structure components, of which three, however, are found to have zero intensity. The theory of the Stark effect given by Schwarzschild and Epstein is adequate provided that the electric separation is so much larger than the fine-structure separation of the unperturbed levels that the latter may be regarded as single; but in weak fields, when this is no longer so, a supplementary investigation becomes necessary. This was carried out by Kramers, who showed, on the basis of Sommerfeld’s original fine-structure theory, that the first effect of a weak electric field is to split each fine-structure level into several, the separation being in all cases proportional to the square of the field so long as this is small. When the field is so large that the fine-structure is negligible in comparison with the electric separation, the latter becomes proportional to the first power of the field, in agreement with Schwarzschild and Epstein. The behaviour of a line arising from a transition between two quantum states will be similar; each of the fine-structure components will first be split into several, with a separation proportional to the square of the field; as the field increases the separations increase, and the components begin to perturb each other in a way which leads ultimately to the ordinary Stark effect.


2013 ◽  
Vol 60 (5) ◽  
pp. 1-26 ◽  
Author(s):  
Pierre Fraigniaud ◽  
Amos Korman ◽  
David Peleg

Author(s):  
John Stillwell

This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.


1990 ◽  
Vol 01 (03) ◽  
pp. 201-217 ◽  
Author(s):  
DANILO BRUSCHI ◽  
DEBORAH JOSEPH ◽  
PAUL YOUNG

Recently, boolean hierarchies over NP and over RP (denoted BH and RBH respectively) have been introduced in complexity theory. They have proved particularly useful in carefully classifying natural problems which are not finely classified using more standard time and space complexity classes. In this paper we are particularly interested in the structural properties of these hierarchies and in relationships among various boolean hierarchies. Establishing the most significant relationships between BH, RBH, and other complexity classes would imply solving some of the major open problems in complexity theory. To date the only significant relations known are: [Formula: see text], [Formula: see text] and RBH⊆BH. Essentially nothing is known about the fine structure of BH or of RBH. In [5] an oracle X is constructed for which both BHx and RBHx have an infinite number of proper levels. Further each level of RBH is properly contained in the corresponding level of BH, and RBH is properly contained in PP. In this paper we further explore these constructions. We prove that some of these separations are “strong” separations. That is, they can be witnessed by sets that cannot be “approximated” by sets in the smaller class: the separating sets are immune to sets from the smaller class. Specifically, we prove that the separations between RBH, BPP, PP and each level of BH, can be witnessed by immune sets.


2015 ◽  
Vol 27 (3) ◽  
pp. 376-404
Author(s):  
ARNO PAULY

Multivalued functions are common in computable analysis (built upon the Type 2 Theory of Effectivity), and have made an appearance in complexity theory under the monikersearch problemsleading to complexity classes such as PPAD and PLS being studied. However, a systematic investigation of the resulting degree structures has only been initiated in the former situation so far (the Weihrauch-degrees).A more general understanding is possible, if the category-theoretic properties of multivalued functions are taken into account. In the present paper, the category-theoretic framework is established, and it is demonstrated that many-one degrees of multivalued functions form a distributive lattice under very general conditions, regardless of the actual reducibility notions used (e.g. Cook, Karp, Weihrauch).Beyond this, an abundance of open questions arises. Some classic results for reductions between functions carry over to multivalued functions, but others do not. The basic theme here again depends on category-theoretic differences between functions and multivalued functions.


Sign in / Sign up

Export Citation Format

Share Document