Related papers: Computability in infinite Galois theory and algori…
We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.
We classify Galois objects for the dual of a group algebra of a finite group over an arbitrary field.
In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend…
We establish an uncountable amenable ergodic Roth theorem, in which the acting group is not assumed to be countable and the space need not be separable. This generalizes a previous result of Bergelson, McCutcheon and Zhang, and complements…
When p divides the ordering of Galois group, the distribution of the Sylow p-subgroup of Cl(K) is closely related to the problem of counting fields with certain specifications. Moreover, different orderings of number fields affect the…
In this paper we discuss applications of our earlier work in studying certain Galois groups and splitting fields of rational functions in $\mathbb Q\left(X_0(N)\right)$ using Hilbert's irreducibility theorem and modular forms. We also…
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…
Some notions from algorithmic randomness are extended to measures and to quantum states. There is a lot on group theory and its relation to logic. This includes some new results on oligomorphic groups. There's also metric spaces and Scott…
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…
Given a number field $k$, we show that, for many finite groups $G$, all the Galois extensions of $k$ with Galois group $G$ cannot be obtained by specializing any given finitely many Galois extensions $E/k(T)$ with Galois group $G$ and $E/k$…
The familiar theories of physics have the feature that the application of the theory to make predictions in specific circumstances can be done by means of an algorithm. We propose a more precise formulation of this feature --- one based on…
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f…
Infinite Time Register Machines ($ITRM$'s) are a well-established machine model for infinitary computations. Their computational strength relative to oracles is understood, see e.g. Koepke (2009), Koepke and Welch (2011) and Koepke and…
Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to…
We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend…
We study the minimal number of ramified primes in Galois extensions of rational function fields over finite fields with prescribed finite Galois group. In particular, we obtain a general conjecture in analogy with the well studied case of…
Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the…
A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…