Related papers: Computable structures of rank omega_1^{CK}
This article provides a simple logical structure, in which affective concepts (i.e. concepts related to emotions and feelings) can be defined. The set of affects defined is similar to the set of emotions covered in the OCC model (Ortony A.,…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
Many of today's problems require techniques that involve the solution of arbitrarily large systems $A\mathbf{x}=\mathbf{b}$. A popular numerical approach is the so-called Greedy Rank-One Update Algorithm, based on a particular tensor…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
Hermitian cubic norm structures were recently introduced in order to study the class of skew-dimension one structurable algebras (which are typically only defined over fields of characteristic different from $2$ and $3$) over arbitrary…
The classical problem of computing a complete system of Stokes multipliers of a linear system of ODEs of rank one in terms of some connection coefficients of an associated hypergeometric system of ODEs, is solved with no genericness…
A Kac-Moody algebra is called hyperbolic if it corresponds to a generalized Cartan matrix of hyperbolic type. We study root subsystems of root systems of hyperbolic algebras. In this paper, we classify maximal rank regular hyperbolic…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
Many combinatorial optimisation problems hide algebraic structures that, once exposed, shrink the search space and improve the chance of finding the global optimal solution. We present a general framework that (i) identifies algebraic…
We give a recursive algorithm for computing the Orlik-Terao algebra of the Coxeter arrangement of type A_{n-1} as a graded representation of S_n, and we give a conjectural description of this representation in terms of the cohomology of the…
We consider Shanks' simplest cubic fields $K$ for which the index $[\mathcal{O}_K:\mathbb{Z}[\rho]]$ of a root $\rho$ of the defining parametric polynomial is $3$. For them, we study the additive indecomposables of $K$ and provide a…
This work examines approaches to making computational models reversible. Broadly speaking, transforming a computational model into a reversible one, i.e. reversibilizing it, means extending its operational semantics conservatively in a way…
In this paper we introduce the notion of $e$-computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.
The conformal transformations with respect to the metric defining the orthogonal Lie algebra o(n) give rise to a one-parameter (c) family of inhomogeneous first-order differential operator representations of the orthogonal Lie algebra…
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…
We consider branched coverings which are simple in the sense that any point of the target has at most one singular preimage. The cobordism classes of $k$-fold simple branched coverings between $n$-manifolds form an abelian group…
The recently initiated approach called computability logic is a formal theory of interactive computation. See a comprehensive online source on the subject at http://www.cis.upenn.edu/~giorgi/cl.html . The present paper contains a soundness…