372 research outputs found
Finite automata and algebraic extensions of function fields
We give an automata-theoretic description of the algebraic closure of the
rational function field F_q(t) over a finite field, generalizing a result of
Christol. The description takes place within the Hahn-Mal'cev-Neumann field of
"generalized power series" over F_q. Our approach includes a characterization
of well-ordered sets of rational numbers whose base p expansions are generated
by a finite automaton, as well as some techniques for computing in the
algebraic closure; these include an adaptation to positive characteristic of
Newton's algorithm for finding local expansions of plane curves. We also
conjecture a generalization of our results to several variables.Comment: 40 pages; expanded version of math.AC/0110089; v2: refereed version,
includes minor edit
Random Subgroups of Rationals
This paper introduces and studies a notion of algorithmic randomness for subgroups of rationals. Given a randomly generated additive subgroup (G,+) of rationals, two main questions are addressed: first, what are the model-theoretic and recursion-theoretic properties of (G,+); second, what learnability properties can one extract from G and its subclass of finitely generated subgroups? For the first question, it is shown that the theory of (G,+) coincides with that of the additive group of integers and is therefore decidable; furthermore, while the word problem for G with respect to any generating sequence for G is not even semi-decidable, one can build a generating sequence beta such that the word problem for G with respect to beta is co-recursively enumerable (assuming that the set of generators of G is limit-recursive). In regard to the second question, it is proven that there is a generating sequence beta for G such that every non-trivial finitely generated subgroup of G is recursively enumerable and the class of all such subgroups of G is behaviourally correctly learnable, that is, every non-trivial finitely generated subgroup can be semantically identified in the limit (again assuming that the set of generators of G is limit-recursive). On the other hand, the class of non-trivial finitely generated subgroups of G cannot be syntactically identified in the limit with respect to any generating sequence for G. The present work thus contributes to a recent line of research studying algorithmically random infinite structures and uncovers an interesting connection between the arithmetical complexity of the set of generators of a randomly generated subgroup of rationals and the learnability of its finitely generated subgroups
Foundations of Online Structure Theory II: The Operator Approach
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
04421 Abstracts Collection -- Algebraic Methods in Computational Complexity
From 10.10.04 to 15.10.04, the Dagstuhl Seminar 04421
``Algebraic Methods in Computational Complexity\u27\u27
was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Learning algebraic structures from text
AbstractThe present work investigates the learnability of classes of substructures of some algebraic structures: submonoids and subgroups of given groups, ideals of given commutative rings, subfields of given vector spaces. The learner sees all positive data but no negative one and converges to a program enumerating or computing the set to be learned. Besides semantical (BC) and syntactical (Ex) convergence also the more restrictive ordinal bounds on the number of mind changes are considered. The following is shown: (a) Learnability depends much on the amount of semantic knowledge given at the synthesis of the learner where this knowledge is represented by programs for the algebraic operations, codes for prominent elements of the algebraic structure (like 0 and 1 fields) and certain parameters (like the dimension of finite-dimensional vector spaces). For several natural examples, good knowledge of the semantics may enable to keep ordinal mind change bounds while restricted knowledge may either allow only BC-convergence or even not permit learnability at all.(b) The class of all ideals of a recursive ring is BC-learnable iff the ring is Noetherian. Furthermore, one has either only a BC-learner outputting enumerable indices or one can already get an Ex-learner converging to decision procedures and respecting an ordinal bound on the number of mind changes. The ring is Artinian iff the ideals can be Ex-learned with a constant bound on the number of mind changes, this constant is the length of the ring. Ex-learnability depends not only on the ring but also on the representation of the ring. Polynomial rings over the field of rationals with n variables have exactly the ordinal mind change bound ωn in the standard representation. Similar results can be established for unars. Noetherian unars with one function can be learned with an ordinal mind change bound aω for some a
- …