{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:47:11Z","timestamp":1773820031862,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_23","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T17:49:27Z","timestamp":1195062567000},"page":"378-388","source":"Crossref","is-referenced-by-count":9,"title":["A Computable Spectral Theorem"],"prefix":"10.1007","author":[{"given":"Martin","family":"Ziegler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasco","family":"Brattka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,22]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V. Brattka","year":"1999","unstructured":"Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65\u201393, 1999.","journal-title":"Theoretical Computer Science"},{"key":"23_CR2","unstructured":"Vasco Brattka and Martin Ziegler. Computability of linear equations. unpublished, 2000."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Peter B\u00fcrgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic complexity theory, vol. 315 of Grundl. der math. Wissenschaften. Springer, Berlin, 1997.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"23_CR4","volume-title":"CBMS Regional Conference Series","author":"F. R.K. Chung","year":"1997","unstructured":"Fan R.K. Chung. Spectral Graph Theory. CBMS Regional Conference Series, vol. 92, American Mathematical Society, Providence 1997."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","volume":"44","author":"A. Grzegorczyk","year":"1957","unstructured":"Andrzej Grzegorczyk. On the definitions of computable real continuous functions. Fundamenta Mathematicae, 44:61\u201371, 1957.","journal-title":"Fundamenta Mathematicae"},{"key":"23_CR6","unstructured":"Tosio Kato. Perturbation Theory for Linear Operators, vol. 132 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin, 2. edition, 1976."},{"key":"23_CR7","unstructured":"Donald E. Knuth. The art of computer programming. Computer Science and Information Processing. Addison-Wesley, Reading, 1981. Volume 2, Seminumerical algorithms."},{"key":"23_CR8","unstructured":"Ker-I Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston, 1991."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Christoph Kreitz and Klaus Weihrauch. A unified approach to constructive and recursive analysis. In M.M. Richter, E. B\u00f6rger, W. Oberschelp et al. eds., Computation and Proof Theory, vol. 1104 of LNM, 259\u2013278, Springer, Berlin, 1984.","DOI":"10.1007\/BFb0099489"},{"key":"23_CR10","first-page":"28","volume":"246","author":"D. Lacombe","year":"1958","unstructured":"Daniel Lacombe. Les ensembles r\u00e9cursivement ouverts ou ferm\u00e9s, et leurs applications \u00e0 l\u2019Analyse r\u00e9cursive. Compt. Rend. Acad. des Sci. Paris, 246:28\u201331, 1958.","journal-title":"Compt. Rend. Acad. des Sci."},{"key":"23_CR11","unstructured":"S. Mazur. Computable Analysis, vol. 33. Razprawy Matematyczne, Warsaw, 1963."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Bojan Mohar and Svatopluk Poljak. Eigenvalues in Combinatorial Optimization. In R. A. Brualdi, S. Friedland and V. Klee, (eds.) Combinatorial and Graph-Theoretic Problems in Linear Algebra, pages 107\u2013151, The IMA Volumes in Mathematics and Its Applications, vol. 50, Springer, Berlin, 1993.","DOI":"10.1007\/978-1-4613-8354-3_5"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.","DOI":"10.1007\/978-3-662-21717-7"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/BF01571652","volume":"113","author":"F. Rellich","year":"1937","unstructured":"Franz Rellich. St\u00f6rungstheorie der Spektralzerlegung I., Analytische St\u00f6rung derisolierten Punkteigenwerte eines beschr\u00e4nkten Operators, in Math. Ann. 113:600\u2013619, 1937.","journal-title":"Math. Ann."},{"key":"23_CR15","unstructured":"Ernst Specker. The fundamental theorem of algebra in recursive analysis. In B. Dejon and P. Henrici, editors, Constructive Aspects of the Fundamental Theorem of Algebra, pages 321\u2013329, London, 1969. Wiley-Interscience."},{"issue":"2","key":"23_CR16","first-page":"230","volume":"42","author":"A. M. Turing","year":"1936","unstructured":"Alan M. Turing. On computable numbers, with an application to the \u201cEntschei-dungsproblem\u201d. Proc. of theLondonMath. Soc.], 42(2):230\u2013265, 193","journal-title":"Proc. of theLondonMath. Soc."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000.","DOI":"10.1007\/978-3-642-56999-9"},{"key":"23_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-44411-4_34","volume-title":"SOFSEM\u20192000: Theory and Practice of Informatics","author":"M. Ziegler","year":"2000","unstructured":"Martin Ziegler and Vasco Brattka. Computing the dimension of linear subspaces. In V. Hlav\u00e1c, K.G. Jeffery and J. Wiedermann, editors, SOFSEM\u20192000: Theory and Practice of Informatics, vol. 1963 of LNCS, 450\u2013458, Springer, Berlin, 20"}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity in Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45335-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T12:12:53Z","timestamp":1556971973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45335-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421979","9783540453352"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45335-0_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}