Are unbounded linear operators computable on the average for Gaussian measures? (Q945917): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2007.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091063198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of solutions of operator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Probabilistic Computability on Represented Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable invariance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective representations of the space of linear bounded operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards computability of elliptic boundary value problems in variational formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2774021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real number model in numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible representations for probability measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on the probability measures on the Borel sets of the unit interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is the complexity of ill-posed problems? / rank
 
Normal rank

Latest revision as of 16:27, 28 June 2024

scientific article
Language Label Description Also known as
English
Are unbounded linear operators computable on the average for Gaussian measures?
scientific article

    Statements

    Are unbounded linear operators computable on the average for Gaussian measures? (English)
    0 references
    0 references
    19 September 2008
    0 references
    The author discusses the problem whether every linear operator \(S: \subseteq X \rightarrow Y\) is computable on the average w.r.t.~a Gaussian measure on \(X\) [see also \textit{J. F. Traub} and \textit{A. G. Werschulz}, Complexity and information, Lezioni Lincee. Cambridge: Cambridge Univ. Press. (1998; Zbl 0917.68094)]. Several interpretations of this question within the framework of type-2 theory of effectivity are given. Furthermore, two equivalent representations for the class of all Gaussian measures on \(\ell^2\) are given.
    0 references
    0 references
    computable analysis
    0 references
    ill-posed problems
    0 references
    Gaussian measures
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references