{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T17:48:39Z","timestamp":1651600119852},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540421979","type":"print"},{"value":"9783540453352","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45335-0_20","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T12:49:27Z","timestamp":1195044567000},"page":"336-356","source":"Crossref","is-referenced-by-count":3,"title":["Some Properties of the Effective Uniform Topological Space"],"prefix":"10.1007","author":[{"given":"Yoshiki","family":"Tsujii","sequence":"first","affiliation":[]},{"given":"Mariko","family":"Yasugi","sequence":"additional","affiliation":[]},{"given":"Takakazu","family":"Mori","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,22]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(95)00249-9","volume":"162","author":"V. Brattka","year":"1996","unstructured":"V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoretical Computer Science 162(1996), 45\u201377.","journal-title":"Theoretical Computer Science"},{"key":"20_CR2","unstructured":"V. Brattka, A Stability Theorem for Recursive Analysis,Proceedings of CCA\u201998 (Brno), Informatik Berichte 235-8\/1998(FernUniversit\u201dat), Computability and Complexity in Analysis, ed. by K-I. Ko et. al,(1998), 1\u201316."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1006\/jcom.1998.0488","volume":"14","author":"V. Brattka","year":"1998","unstructured":"V. Brattka and P. Hertling, Feasible Real Random Access Machines, Journal of Complexity,14(1998),490\u2013526.","journal-title":"Journal of Complexity"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"372","DOI":"10.2307\/1990619","volume":"65","author":"N.J. Fine","year":"1949","unstructured":"N.J. Fine, On the Walsh Functions, Trans. Amer. Math. Soc.,65(1949), 372\u2013414.","journal-title":"Trans. Amer. Math. Soc."},{"key":"20_CR5","unstructured":"P. Hertling, Effectivity and effective continuity of functions between computable metric spaces, Combinatorics, Complexity and Logic, Proceedings of DMTCS\u201996(1997), 264\u2013275."},{"key":"20_CR6","unstructured":"Y. Kawada and Y. Mimura, Outline of Modern Mathematics (in Japanese),Iwanami Shoten, 1965."},{"key":"20_CR7","unstructured":"T. Mori,On the computability of Walsh functions, to appear in TCS."},{"key":"20_CR8","unstructured":"T. Mori, Computabilities of Fine-continuous functions, Computability and Complexity in Analysis, Proceedings of CCA2000(2000), 299\u2013318."},{"key":"20_CR9","unstructured":"T. Mori, Y. Tsujii and M. Yasugi, Computability structure on metric spaces, Combinatorics, Complexity and Logic (Proceedings of DMTCS\u201996), ed. by Bridges et.al,Springer(1996),351\u2013362."},{"key":"20_CR10","volume-title":"Modern General Topology","author":"J. Nagata","year":"1968","unstructured":"J. Nagata, Modern General Topology, 1968, North-Holland Publ.Co., Amsterdam"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"M.B. Pour-El and J.I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer-Verlag, 1989.","DOI":"10.1007\/978-3-662-21717-7"},{"key":"20_CR12","unstructured":"F. Shipp, W.R. Wade and P. Simon, Walsh Series, Adam Hilger, 1990."},{"key":"20_CR13","series-title":"Series F: Computer and Systems Sciences","first-page":"341","volume-title":"Proc. NATO Advanced Study Institute Int. Summer School at Marktoberdorf on Proof and computation","author":"J.V. Tucker","year":"1994","unstructured":"J.V. Tucker and J.I. Zucker, Computable functions on stream algebras, Proc. NATO Advanced Study Institute Int. Summer School at Marktoberdorf on Proof and computation (ed. H. Schwichtenberg), Series F: Computer and Systems Sciences, Springer-Verlag, Berlin(1994),341\u2013382."},{"key":"20_CR14","unstructured":"J.V. Tucker and J.I. Zucker, Computable functions and semicomputable sets on many-sorted semicomputable sets on many-sorted algebras, Handbook of Logic in Computer Science,.vol.5 (ed. S. Abramski et al), Oxford University Press (1998)."},{"key":"20_CR15","first-page":"1","volume":"42","author":"M. Washihara","year":"1995","unstructured":"M. Washihara, Computability and Fr\u00e9chet space, Mathematica Japonica, 42(1995),1\u201313.","journal-title":"Mathematica Japonica"},{"issue":"1","key":"20_CR16","first-page":"1","volume":"50","author":"M. Washihara","year":"1999","unstructured":"M. Washihara, Computability and tempered distributions, ibid.,50,1(1999),1\u20137.","journal-title":"Computability and tempered distributions"},{"key":"20_CR17","first-page":"1","volume":"43","author":"M. Washihara","year":"1996","unstructured":"M. Washihara and M. Yasugi, Computability and metrics in a Fr\u00e9chet space, ibid., 43(1996), 1\u201313","journal-title":"Computability and metrics in a Fr\u00e9chet space"},{"key":"20_CR18","unstructured":"K. Weihrauch, A foundation for computable analysis, Combinatorics, Complexity, and Logic(Proceedings of DMTCS\u201996),ed. by D.S. Bridges et al,(1996), 66\u201389."},{"key":"20_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/BFb0045083","volume-title":"Computing and Combinatorics","author":"K. Weihrauch","year":"1997","unstructured":"K. Weihrauch and X. Zheng, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, Computing and Combinatorics, ed. by T. Jiang and D.T. Lee,LNCS,1276(1997),Springer,166\u2013175."},{"key":"20_CR20","unstructured":"M. Yasugi, V. Brattka and M. Washihara, Computability problems of the Gau\u03b2ian function, Manuscript (2001): available at \n http:\/\/www.kyoto-su.ac.jp\/~yasugi\/Recent\n \n ."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/S0304-3975(98)00301-6","volume":"219","author":"M. Yasugi","year":"1999","unstructured":"M. Yasugi, T. Mori and Y. Tsujii, Effective Properties of Sets and Functions in Metric Spaces with Computability Structure, Theoretical Computer Science, 219(1999), 467\u2013486.","journal-title":"Theoretical Computer Science"},{"key":"20_CR22","first-page":"215","volume":"13","author":"M. Yasugi","year":"2000","unstructured":"M. Yasugi and M. Washihara, Computability structures in analysis, Sugaku Expositions (AMS), 13(2000), 215\u2013235.","journal-title":"Sugaku Expositions (AMS)"},{"key":"20_CR23","unstructured":"M. Yasugi and M. Washihara, A note on Rademacher functions and computability, manuscript: available at \n http:\/\/www.kyoto-su.ac.jp\/~yasugi\/Recent\n \n ."}],"container-title":["Computability and Complexity in Analysis","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45335-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:20:41Z","timestamp":1551079241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45335-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421979","9783540453352"],"references-count":23,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45335-0_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}