scientific article; zbMATH DE number 3200656
From MaRDI portal
Publication:5737081
zbMath0124.00402MaRDI QIDQ5737081
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis ⋮ Formal spaces and their effective presentations ⋮ A sequentially computable function that is not effectively continuous at any point ⋮ Recursive topological spaces ⋮ A Chain of Inclusion Relations in Computable Analysis ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Separating notions in effective topology ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Metric spaces in synthetic topology ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ Domain representability of metric spaces ⋮ Completeness: when enough is enough ⋮ Computability of simple games: A characterization and application to the core ⋮ A Banach-Mazur computable but not Markov computable function on the computable real numbers ⋮ Computability on computable metric spaces ⋮ The concept of effective method applied to computational problems of linear algebra ⋮ Concrete models of computation for topological algebras ⋮ Computation by `While' programs on topological partial algebras
