Related papers: Computability Theory, Nonstandard Analysis, and th…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles.…
A product of compact normal spaces is normal; the product of a countably infinite collection of non-trivial spaces is normal if and only if it is countably paracompact and each of its finite sub-products is normal; if all powers of a space…
This note has two principal aims: to portray an essence of Non-Standard Analysis as a particular structure (which we call lim-rim), noting its interplay with the notion of ultrapower, and to present a construction of Non-Standard Analysis,…
We present an effective criterion to determine if a normal analytic compactification of C^2 with one irreducible curve at infinity is algebraic or not. As a by product we establish a correspondence between normal algebraic compactifications…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
We first propose a conformal geometry for Connes-Landi noncommutative manifolds and study the associated scalar curvature. The new scalar curvature contains its Riemannian counterpart as the commutative limit. Similar to the results on…
Czachor's recent proposal introduces a form of non-Newtonian calculus built by pulling back arithmetic operations through arbitrary bijections between continua. Although the idea is mathematically inventive, it runs into serious conceptual…
We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…
We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the…
This thesis addresses Pour-El and Richards' fourth question from their book "Computability in analysis and physics", concerning the relation between higher order recursion theory and computability in analysis. Among other things it is shown…
In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…
We investigate the $\mathcal F$-Borel complexity of topological spaces in their different compactifcations. We provide a simple proof of the fact that a space can have arbitrarily many different complexities in different compactifications.…
This work establishes computable bounds between f-divergences for probability measures within a generalized quasi-$\varepsilon_{(M,m)}$-neighborhood framework. We make the following key contributions. (1) a unified characterization of local…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countable $T_0$ space is admissible with respect to the topology…
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…
We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…