Related papers: A topological view on algebraic computation models
Classical approach of solvability problem has shed much light on what we can solve and what we cannot solve mathematically. Starting with quadratic equation, we know that we can solve it by the quadratic formula which uses square root.…
We investigate the computability (in the sense of computable analysis) of the topological pressure $P_{\rm top}(\phi)$ on compact shift spaces $X$ for continuous potentials $\phi:X\to {\mathbb R}$. This question has recently been studied…
The topological coset model appraoch to non-critical string models is summarized. The action of a topological twisted ${G\over H}$ coset model ($rank\ H = rank\ G$) is written down. A ``topological coset algebra" is derived and compared…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over "large" topological spaces. This framework has been applied to study the complexity of the differential operator and the…
We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction…
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the…
The aim of these notes is to present an accessible overview of some topics in classical algebraic geometry which have applications to aspects of discrete integrable systems. Precisely, we focus on surface theory on the algebraic geometry…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
In this paper we present an introduction to the area of computability in dynamical systems. This is a fairly new field which has received quite some attention in recent years. One of the central questions in this area is if relevant…
The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
Weihrauch complexity is now an established and active part of mathematical logic. It can be seen as a computability-theoretic approach to classifying the uniform computational content of mathematical problems. This theory has become an…
We introduce the notion of being Weihrauch-complete for layerwise computability and provide several natural examples related to complex oscillations, the law of the iterated logarithm and Birkhoff's theorem. We also consider hitting time…
The Bethe-Salpeter equation (BSE) is currently the state of the art in the description of neutral electron excitations in both solids and large finite systems. It is capable of accurately treating charge-transfer excitations that present…
We construct a zero curvature formulation, in superspace, for the sTB-B hierarchy which naturally reduces to the zero curvature condition in terms of components, thus solving one of the puzzling features of this model. This analysis,…