Related papers: Towards computable analysis on the generalised rea…
Generalized (\kappa ,\mu)-space forms are introduced and studied. We examine in depth the contact metric case and present examples for all possible dimensions. We also analyse the trans-Sasakian case.
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…
If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…
Let kappa be an uncountable regular cardinal. Call an equivalence relation on functions from kappa into 2 Sigma_1^1-definable over H(kappa) if there is a first order sentence F and a parameter R subseteq H(kappa) such that functions…
For a curve $\boldsymbol{\gamma}:I\to\mathbb{R}^n$ of order $n-1$, we prove that the generalized curvatures $\kappa_1, \ldots, \kappa_{n-1}$ can be expressed in terms of the leading principal minors of the matrix…
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…
We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate them to any given precision $\epsilon$. This is contrary to popular belief, as all dynamical properties are…
A cardinal kappa is countably closed if mu^omega < kappa whenever mu < kappa. Assume that there is no inner model with a Woodin cardinal and that every set has a sharp. Let K be the core model. Assume that kappa is a countably closed…
From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation…
It is shown that the power set of $\kappa$ ordered by the subset relation modulo various versions of the non-stationary deal can be embedded into the partial order of Borel equivalence relations on $2^\kappa$ under Borel reducibility. Here…
We describe the generalized kappa-deformations of D=4 relativistic symmetries with finite masslike deformation parameter kappa and an arbitrary direction in kappa-deformed Minkowski space being noncommutative. The corresponding bicovariant…
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…
We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on their width or length. An alternative viewpoint is that we study…
We start by giving a survey to the theory of Borel*(\kappa) sets in the generalized Baire space Baire({\kappa}) = {\kappa}^{\kappa}. In particular we look at the relation of this complexity class to other complexity classes which we denote…
The theory of the $\kappa$-deformed Poincare algebra is applied to the analysis of various phenomena in special relativity, quantum mechanics and field theory. The method relies on the development of series expansions in $\kappa^{-1}$ of…
We uncover an infinite number of vacua in two-dimensional quantum field theory, the Klein-Gordon field for simplicity, by conceiving a new mode that is classified by a real positive parameter $\kappa$. We show each mode has a distinct…
We discuss the rainbow Ramsey theorems at limit cardinals and successors of singular cardinals, addressing some questions in \cite{MR2354904} and \cite{MR2902230}. In particular, we show for inaccessible $\kappa$,…
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…
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
The subalgebra of the tautological ring of the moduli of curves of compact type generated by the kappa classes is studied. Relations, constructed via the virtual geometry of the moduli of stable maps, are used to prove universality results…