Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra
M Ziegler - Annals of Pure and Applied Logic, 2012 - Elsevier
It is folklore particularly in numerical and computer sciences that, instead of solving some
general problem f: X∋ x↦ f (x)∈ Y, additional structural information about the input x∈ X (eg …
general problem f: X∋ x↦ f (x)∈ Y, additional structural information about the input x∈ X (eg …
[PDF][PDF] On additive countably continuous functions
T Natkaniec - Publ. Math. Debrecen, 2011 - scholar.archive.org
We construct an example of additive Darboux function f: R→ R which is strongly countably
continuous and discontinuous. We show also that if an additive function f is covered by …
continuous and discontinuous. We show also that if an additive function f is covered by …
[引用][C] ORBITS AND CONTINUITY OF CERTAIN CLASS OF FUNCTIONS
K Muthuvel - International Journal of Pure and Applied Mathematics, 2009