Results 231 to 240 of about 10,740 (264)
Some of the next articles are maybe not open access.
A foundation for computable analysis
1997While for countable sets there is a single well established computability theory (ordinary recursion theory), Computable Analysis is still underdeveloped. Several mutually non-equivalent theories have been proposed for it, none of which, however, has been accepted by the majority of mathematicians or computer scientists.
openaire +1 more source
Analysis in the Computable Number Field
Journal of the ACM, 1968It is well known that real variable analysis is nonconstructive. For example, although it is asserted that every bounded monotone sequence converges to a limit, there is no algorithm for obtaining this limit. This paper presents a constructive analysis which is restricted to a countable set of numbers, the field of computable numbers.
openaire +2 more sources
A foundation of computable analysis
Bull. EATCS, 1995Summary: While for countable sets there is a single computability theory (ordinary recursion theory), for computability in analysis several mutually non-equivalent theories have been proposed, none of which, however, has been accepted by the majority of mathematicians or computer scientists. One of these theories, TTE (Type 2 Theory of Effectivity), is
openaire +1 more source
COMPUTATIONAL ANALYSIS OF GENETIC SEQUENCES
Annual Review of Biophysics and Biophysical Chemistry, 1986Much computational processing of sequence data can be accomplished by applying the kinds of computational tools and processes widely used in text processing, perhaps specialized to sequences, but not necessarily so. A number of programs have been developed specifically to assist in assembling sequences from individually sequenced restriction fragments.
openaire +2 more sources
COMPUTER ANALYSIS OF ECHOCARDIOGRAMS
Medical Journal of Australia, 1977N M, Bass, R M, Whitlock
openaire +2 more sources
Semicomputable manifolds in computable topological spaces
Journal of Complexity, 2018Zvonko Iljazović
exaly
Generalized computable numerations and nontrivial rogers semilattices
Algebra and Logic, 1997Sergey Goncharov, Goncharov S S
exaly
Constructivity, computability, and computational complexity in analysis
1989openaire +1 more source