Results 21 to 30 of about 120,189 (290)
Effective representations of the space of linear bounded operators
Representations of topological spaces by infinite sequences of symbols are used in computable analysis to describe computations in topological spaces with the help of Turing machines.
Vasco Brattka
doaj +1 more source
Linked Metadata for FAIR Digital Objects Carrying Computable Knowledge [PDF]
Introduction To advance the goals of the Mobilizing Computable Biomedical Knowledge (MCBK) Movement, we are exploring the use of FAIR Digital Objects (FDOs) (De Smedt et al. 2020, Williams et al. 2021).First, we are beginning to clarify the full range of
Allen Flynn +5 more
doaj +3 more sources
A computable general equilibrium model of the southeastern Colorado economy is used to compare the economic impacts of a proposed increase in reservoir storage to an alternative: temporary water transfers.
D. Jay Goodman
doaj +1 more source
This paper investigates the complexity of real functions through proof techniques inspired by formal language theory. Productiveness, which is a stronger form of non-recursive enumerability, is employed to analyze the complexity of various problems ...
Jingnan Xie +2 more
doaj +1 more source
A framework for annotating human genome in disease context. [PDF]
Identification of gene-disease association is crucial to understanding disease mechanism. A rapid increase in biomedical literatures, led by advances of genome-scale technologies, poses challenge for manually-curated-based annotation databases to ...
Wei Xu +6 more
doaj +1 more source
The weakness of being cohesive, thin or free in reverse mathematics [PDF]
Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse mathematics ...
Patey, Ludovic
core +3 more sources
We consider exact quantum circuit synthesis, quantum gate efficiency, and the spectral gap conjecture from the perspective of computable analysis. Circuit synthesis, in both its exact and its approximate variant, is fundamental to the circuit model of ...
Yannik N. Boeck +2 more
doaj +1 more source
Computability and Analysis, a Historical Approach
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 to measure ...
Brattka, Vasco
core +1 more source
Abstract Geometrical Computation and Computable Analysis [PDF]
Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary encoding. This relies on an intermediate representation of any real number as an integer (in signed binary) plus an exact value in $(-1,1)$ which allows to have ...
openaire +2 more sources
Computable Frames in Computable Banach Spaces
We develop some parts of the frame theory in Banach spaces from the point of view of Computable Analysis. We define computable M-basis and use it to construct a computable Banach space of scalar valued sequences.
S.K. Kaushik, Poonam Mantry
doaj +2 more sources

