Related papers: Computability Theory, Nonstandard Analysis, and th…
For metric spaces, the doubling property, the uniform disconnectedness, and the uniform perfectness are known as quasi-symmetric invariant properties. The David-Semmes uniformization theorem states that if a compact metric space satisfies…
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
Theorems crucial in elementary real function theory have proofs in which compactness arguments are used. Despite the introduction in relatively recent literature of each new highly elegant compactness argument, or of an equivalent, this…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
The Heine-Borel theorem for uncountable coverings has recently emerged as an interesting and central principle in higher-order Reverse Mathematics and computability theory, formulated as follows: HBU is the Heine-Borel theorem for…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles.…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
In this paper it is proven that if the group of covering translations of the covering space of a compact, connected, $P^2$-irreducible 3-manifold corresponding to a non-trivial, finitely-generated subgroup of its fundamental group is…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
The reconstruction of an unknown quantity from noisy measurements is a mathematical problem relevant in most applied sciences, for example, in medical imaging, radar inverse scattering, or astronomy. This underlying mathematical problem is…
We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…
Deep neural networks generalize well on unseen data though the number of parameters often far exceeds the number of training examples. Recently proposed complexity measures have provided insights to understanding the generalizability in…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…
This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…
We give a novel and effective criterion for algebraicity of rational normal analytic surfaces constructed from resolving the singularity of an irreducible curve-germ on $CP^2$ and contracting the strict transform of a given line and all but…