On the computability of Walsh functions. (Q1607297): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5422248 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Generalized Walsh Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Walsh Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999467 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4217607 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994907 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4546073 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Effective properties of sets and functions in metric spaces with computability structure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An application of Walsh Fourier analysis to weakly stationary processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability on computable metric spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4436366 / rank | |||
Normal rank |
Latest revision as of 12:17, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computability of Walsh functions. |
scientific article |
Statements
On the computability of Walsh functions. (English)
0 references
31 July 2002
0 references
The Haar and the Walsh functions are proved to be computable with respect to the Fine-metric \(d_{F}\) which is induced from the infinite product \(\Omega = {0,1}{^{1,2,\ldots}}\) with the weighted product metric \(d_{C}\) of the discrete metric on \({0,1}.\) Although they are discontinuous functions on \([0,1]\) with respect to the Euclidean metric, they are continuous functions on \((\Omega,d_{C})\) and on \(([0,1],d_{F}).\) On \((\Omega,d_{C})\), computable real-valued cylinder functions, which include the Walsh functions, become computable and every computable function can be approximated effectively by a computable sequence of cylinder functions. The metric space \(([0,1],d_{F})\) is separable but not complete nor effectively complete. We say that a function on \([0,1]\) is uniformly Fine-computable if it is sequentially computable and effectively uniformly continuous with respect to the metric \(d_{F}.\) It is proved that a uniformly Fine-computable function is essentially a computable function on \(\Omega\). It is also proved that Walsh--Fourier coefficients of a uniformly Fine-computable function \(f\) form a computable sequence of reals and there exists a subsequence of the Walsh--Fourier series which Fine-converges effectively uniformly to \(f.\).
0 references
Metric space with computability structure
0 references
Computable function
0 references
Dyadic group
0 references
Walsh function
0 references
Walsh-Fourier series
0 references
0 references