@article{UBHD-67566406, editor={Ambos-Spies, Klaus}, title={2011 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium ’11}, subtitle={Barcelona, Catalonia, Spain, July 11 - 16, 2011}, year={2012}, pages={418-476}, language={eng}, issn={1943-5894}, volume={18}, number={3}, note={Abstracts of invited and contributed talks. - Gesehen am 11.04.2014}, journal={Bulletin of symbolic logic}, } @article{UBHD-68575943, author={Ambos-Spies, Klaus}, title={Automorphism bases for the recursively enumerable degrees}, subtitle={in memory of S. Barry Cooper (1943-2015)}, year={2018}, pages={237-258}, language={eng}, issn={2211-3576}, volume={7}, number={2-3}, note={Gesehen am 12.05.2020}, journal={Computability}, doi={10.3233/COM-180088}, } @article{UBHD-69089308, author={Ambos-Spies, Klaus and Nies, André}, title={Cappable recursively enumerable degrees and Post's program}, year={1992}, pages={51-56}, language={eng}, issn={1432-0665}, volume={32}, number={1}, note={Gesehen am 26.06.2023}, journal={Archive for mathematical logic}, doi={10.1007/BF01270394}, } @conference{UBHD-68086800, author={Ambos-Spies, Klaus and Bentzien, Levke and Fejer, Peter A. and Merkle, Wolfgang and Stephan, Frank}, title={Collapsing polynomial-time degrees}, year={2000}, pages={1-24}, language={eng}, isbn={1-56881-113-6 and 1-56881-114-4 and 978-1-56881-113-0 and 978-1-56881-114-7}, } @article{UBHD-67566405, author={Ambos-Spies, Klaus and Bakibayev, Timur}, title={Comparing nontriviality for E and EXP}, year={2012}, pages={106-122}, language={eng}, issn={1433-0490}, volume={51}, number={1}, note={Gesehen am 11.04.2014}, journal={Theory of computing systems}, doi={10.1007/s00224-011-9370-3}, } @incollection{UBHD-69066968, author={Ambos-Spies, Klaus}, title={A comparison of weak completeness notions}, year={1996}, pages={171-178}, language={eng}, isbn={0818673885}, booktitle={Proceedings / Eleventh Annual IEEE Conference on Computational Complexity}, editor={Homer, Steven}, } @article{UBHD-67566407, author={Ambos-Spies, Klaus}, title={Computability in Europe 2009}, year={2012}, pages={483-484}, language={eng}, issn={1873-2461}, volume={163}, number={5}, journal={Annals of pure and applied logic}, doi={10.1016/j.apal.2011.06.006}, } @article{UBHD-67567045, author={Ambos-Spies, Klaus}, title={Computability in Europe 2009}, year={2013}, pages={727-728}, language={eng}, issn={1465-363X}, volume={23}, number={4}, journal={Journal of logic and computation}, doi={10.1093/logcom/exr051}, } @article{UBHD-69084317, author={Ambos-Spies, Klaus and Lachlan, Alistair H. and Soare, Robert I.}, title={The continuity of cupping to 0'}, year={1993}, pages={195-209}, language={eng}, issn={1873-2461}, volume={64}, number={3}, note={Elektronische Reproduktion der Druck-Ausgabe 21. M{\"a}rz 2002 ; Gesehen am 12.06.2023}, journal={Annals of pure and applied logic}, doi={10.1016/0168-0072(93)90143-2}, } @article{UBHD-69066930, author={Ambos-Spies, Klaus and Fejer, Peter A. and Lempp, Steffen and Lerman, Manuel}, title={Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices}, year={1996}, pages={880-905}, language={eng}, issn={1943-5886}, volume={61}, number={3}, note={Elektronische Reproduktion der Druck-Ausgabe 12. M{\"a}rz 2014 ; Gesehen am 19.04.2023}, journal={The journal of symbolic logic}, doi={10.2307/2275790}, } @incollection{UBHD-68015344, author={Ambos-Spies, Klaus and Fejer, Peter A.}, title={Degrees of unsolvability}, year={2014}, pages={443-494}, language={eng}, isbn={978-0-08-093067-1 and 0-08-093067-0 and 1-322-47717-5 and 978-1-322-47717-6}, note={Gesehen am 08.08.2016}, booktitle={Computational logic}, editor={Gabbay, Dov M. and Siekmann, J{\"o}rg and Woods, John}, doi={10.1016/B978-0-444-51624-4.50010-1}, } @article{UBHD-69081019, author={Ambos-Spies, Klaus and Decheng, Ding}, title={Discontinuity of cappings in the recursively enumerable degrees and strongly nonbranching degrees}, year={1994}, pages={287-317}, language={eng}, issn={1521-3870}, volume={40}, number={3}, note={Gesehen am 31.05.2023}, journal={Mathematical logic quarterly}, doi={10.1002/malq.19940400302}, } @incollection{UBHD-69084336, author={Ambos-Spies, Klaus and Decheng, Ding and Fejer, Peter A.}, title={Embedding distributive lattices preserving 1 below a nonzero recursively enumerable turing degree}, year={1993}, pages={92-129}, language={eng}, isbn={978-1-4612-0325-4}, note={Gesehen am 12.06.2023}, booktitle={Logical methods}, editor={Crossley, John N. and Remmel, Jeffrey B. and Shore, Richard and Sweedler, Moss E.}, doi={10.1007/978-1-4612-0325-4_2}, } @article{UBHD-69066980, author={Ambos-Spies, Klaus and Neis, Hans-Christian and Terwijn, Sebastiaan A.}, title={Genericity and measure for exponential time}, year={1996}, pages={3-19}, language={eng}, issn={1879-2294}, volume={168}, number={1}, note={Elektronische Reproduktion der Druck-Ausgabe 16. Februar 1999 ; Gesehen am 19.04.2023}, journal={Theoretical computer science}, doi={10.1016/0304-3975(96)89424-2}, } @incollection{UBHD-69081016, author={Ambos-Spies, Klaus and Neis, Hans-Christian and Terwijn, Sebastiaan A.}, title={Genericity and measure for exponential time}, year={1994}, pages={221-232}, language={eng}, isbn={9783540486633}, note={Elektronische Reproduktion der Druck-Ausgabe 1. Januar 2005 ; Gesehen am 31.05.2023}, booktitle={Mathematical Foundations of Computer Science 1994}, doi={10.1007/3-540-58338-6_69}, } @article{UBHD-67567048, author={Ambos-Spies, Klaus and Badaev, Serikzhan and Gončarov, Sergej S.}, title={Inductive inference and computable numberings}, year={2011}, pages={1652-1668}, language={eng}, issn={1879-2294}, volume={412}, number={18}, journal={Theoretical computer science}, doi={10.1016/j.tcs.2010.12.041}, } @article{UBHD-69081011, author={Ambos-Spies, Klaus and Lempp, Steffen and Lerman, Manuel}, title={Lattice embeddings into the R.E. degrees Preserving 0 and 1}, year={1994}, pages={1-15}, language={eng}, issn={1469-7750}, volume={49}, number={1}, note={Gesehen am 31.05.2023}, journal={Journal of the London Mathematical Society}, doi={10.1112/jlms/49.1.1}, } @article{UBHD-67567046, author={Ambos-Spies, Klaus and Merkle, Wolfgang}, title={Maximal pairs of computably enumerable sets in the computably Lipschitz degrees}, year={2013}, pages={2-27}, language={eng}, issn={1433-0490}, volume={52}, number={1}, journal={Theory of computing systems}, doi={10.1007/s00224-012-9424-1}, } @article{UBHD-69080636, author={Ambos-Spies, Klaus and Homer, Steven and Soare, Robert I.}, title={Minimal pairs and complete problems}, year={1994}, pages={229-241}, language={eng}, issn={1879-2294}, volume={132}, number={1}, note={Elektronische Reproduktion der Druck-Ausgabe 1. April 2002 ; Gesehen am 30.05.2023}, journal={Theoretical computer science}, doi={10.1016/0304-3975(94)90234-8}, } @article{UBHD-67566410, author={Ambos-Spies, Klaus and Bakibayev, Timur}, title={Nontriviality for exponential time w.r.t. weak reducibilities}, year={2013}, pages={2-12}, language={eng}, issn={1879-2294}, volume={494}, journal={Theoretical computer science}, doi={10.1016/j.tcs.2012.05.022}, } @article{UBHD-68803372, author={Ambos-Spies, Klaus and Merkle, Wolfgang and Terwijn, Sebastiaan A.}, title={Normalized information distance and the oscillation hierarchy}, year={2022}, pages={65-76}, language={eng}, issn={1090-2724}, volume={124(2022) vom: M{\"a}rz}, note={Available online 24 September 2021 ; Gesehen am 19.11.2021}, journal={Journal of computer and system sciences}, doi={10.1016/j.jcss.2021.08.006}, } @article{UBHD-69195401, author={Ambos-Spies, Klaus and Downey, Rod G. and Monath, Martin and Ng, Keng Meng}, title={Notes on Sacks' splitting theorem}, year={2023}, pages={30 S.}, language={eng}, issn={1943-5886}, number={online ahead of print}, note={Gesehen am 26.03.2024}, journal={The journal of symbolic logic}, doi={10.1017/jsl.2023.77}, } @article{UBHD-67844810, author={Ambos-Spies, Klaus}, title={Numberings and learnability}, year={2014}, pages={302-303}, language={eng}, issn={1818-9962}, volume={35}, number={4}, note={Gesehen am 13.07.2015}, journal={Lobachevskii journal of mathematics}, doi={10.1134/S1995080214040106}, } @article{UBHD-68878563, author={Ambos-Spies, Klaus and Downey, R. G. and Monath, Martin}, title={On supersets of non-low2 sets}, year={2021}, pages={1282-1292}, language={eng}, issn={1943-5886}, volume={86}, number={3}, note={Gesehen am 15.02.2022 ; Im Titel ist "2" nach non-low tiefgestellt ; Der Artikel ist Teil von "Computability and recursion theory"}, journal={The journal of symbolic logic}, doi={10.1017/jsl.2021.72}, } @incollection{UBHD-67844807, author={Ambos-Spies, Klaus}, title={On the strongly bounded turing degrees of simple sets}, year={2014}, pages={23-78}, language={eng}, isbn={978-1-61451-804-4}, note={Gesehen am 13.07.2015}, booktitle={Logic, Computation, Hierarchies}, editor={Brattka, Vasco and Diener, Hannes and Spreen, Dieter}, doi={10.1515/9781614518044.23}, } @book{UBHD-67567041, author={Ambos-Spies, Klaus}, title={On the structure of the recursively enumerable degrees}, year={1981}, pages={IX, 160 S.}, language={eng}, school={M{\"u}nchen, Univ., Diss., 1981}, keywords={Rekursionstheorie ; Rekursiv aufz{\"a}hlbare Menge}, } @article{UBHD-67567044, author={Ambos-Spies, Klaus and Kr{\"a}ling, Thorsten}, title={The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent}, year={2013}, pages={577–588}, language={eng}, issn={1873-2461}, volume={164}, number={5}, journal={Annals of pure and applied logic}, doi={ 10.1016/j.apal.2012.11.002}, } @incollection{UBHD-68086790, author={Ambos-Spies, Klaus}, title={Polynomial time reducibilities and degrees}, year={1999}, pages={683-705}, language={eng}, isbn={0-444-89882-4 and 978-0-08-053304-9 and 0-08-053304-3 and 978-0-444-89882-1}, note={Gesehen am 20.02.2017}, booktitle={Handbook of computability theory}, editor={Griffor, Edward R.}, doi={10.1016/S0049-237X(99)80034-2}, } @article{UBHD-68987832, author={Ambos-Spies, Klaus and Kr{\"a}ling, Thorsten}, title={Quantitative aspects of speed-up and gap phenomena}, year={2010}, pages={707-722}, language={eng}, issn={1469-8072}, volume={20}, number={5}, note={Gesehen am 22.11.2022}, journal={Mathematical structures in computer science}, doi={10.1017/S0960129510000174}, } @incollection{UBHD-67567047, author={Ambos-Spies, Klaus and Brandt, Ulrike and Ziegler, Martin}, title={Real benefit of promises and advice}, year={2013}, pages={1-11}, language={eng}, isbn={3-642-39052-8 and 978-3-642-39052-4}, booktitle={The nature of computation}, editor={Bonizzoni, Paola and Brattka, Vasco and L{\"o}we, Benedikt}, } @book{UBHD-69065758, author={Ambos-Spies, Klaus}, editor={M{\"u}ller, Gert H. and Sacks, Gerald E.}, title={Recursion Theory Week}, subtitle={Proceedings of a Conference held in Oberwolfach, FRG, March 19-25, 1989}, publisher={Springer Berlin Heidelberg}, address={Berlin, Heidelberg}, year={1990}, pages={Online-Ressource (VIII, 400 p, online resource)}, language={eng}, isbn={978-3-540-47142-4 and 978-3-540-52772-5}, number={ARRAY(0x559f10213e20)}, series={Lecture notes in mathematics}, doi={10.1007/BFb0086109}, keywords={Rekursionstheorie}, } @incollection{UBHD-69081010, author={Ambos-Spies, Klaus and Terwijn, Sebastiaan A. and Zheng, Xizhong}, title={Resource bounded randomness and weakly complete problems}, year={1994}, pages={369-377}, language={eng}, isbn={9783540486534}, note={Elektronische Reproduktion der Druck-Ausgabe 1. Januar 2005 ; Gesehen am 31.05.2023}, booktitle={Algorithms and computation}, doi={10.1007/3-540-58325-4_201}, } @incollection{UBHD-69066459, author={Ambos-Spies, Klaus and Mayordomo, Elvira and Wang, Yongge and Zheng, Xizhong}, title={Resource-bounded balanced genericity, stochasticity and weak randomness}, year={1996}, pages={63-74}, language={eng}, isbn={9783540497233}, note={Elektronische Reproduktion der Druck-Ausgabe 1. Januar 2005 ; Gesehen am 18.04.2023}, booktitle={Proceedings / STACS 96}, doi={10.1007/3-540-60922-9_6}, } @incollection{UBHD-69066490, author={Ambos-Spies, Klaus}, title={Resource bounded genericity}, year={1996}, pages={1-60}, language={eng}, isbn={978-0-511-62916-7}, note={Elektronische Reproduktion der Druck-Ausgabe 23. Februar 2010 ; Gesehen am 18.04.2023}, booktitle={Computability, enumerability, unsolvability}, editor={Cooper, Stuart B. and Slaman, T. and Wainer, S.}, } @incollection{UBHD-69066013, author={Ambos-Spies, Klaus and Mayordomo, Elvira}, title={Resource-bounded measure and randomness}, year={1997}, pages={1-47}, language={eng}, isbn={0-8247-0026-0 and 978-0-8247-0026-3}, booktitle={Complexity, logic, and recursion theory}, editor={Sorbi, Andrea}, } @article{UBHD-69066016, author={Ambos-Spies, Klaus and Terwijn, Sebastiaan A. and Zheng, Xizhong}, title={Resource bounded randomness and weakly complete problems}, year={1997}, pages={195-207}, language={eng}, issn={1879-2294}, volume={172}, number={1}, note={Elektronische Reproduktion der Druck-Ausgabe 9. November 1999 ; Gesehen am 17.04.2023}, journal={Theoretical computer science}, doi={10.1016/S0304-3975(95)00260-X}, } @incollection{UBHD-69066023, author={Ambos-Spies, Klaus and Bentzien, Levke}, title={Separating NP-completeness notions under strong hypotheses}, year={1997}, pages={121-127}, language={eng}, isbn={0818679077}, booktitle={Proceedings / Twelfth Annual IEEE Conference on Computational Complexity; (formerly: Structure in Complexity Theory Conference)}, } @article{UBHD-69089335, author={Ambos-Spies, Klaus and Nies, André and Shore, Richard A.}, title={The theory of the recursively enumerable weak truth-table degrees is undecidable}, year={1992}, pages={864-874}, language={eng}, issn={1943-5886}, volume={57}, number={3}, note={Elektronische Reproduktion der Druck-Ausgabe 12. M{\"a}rz 2014 ; Gesehen am 26.06.2023}, journal={The journal of symbolic logic}, doi={10.2307/2275436}, } @article{UBHD-69084314, author={Ambos-Spies, Klaus and Shore, Richard A.}, title={Undecidability and 1-types in the recursively enumerable degrees}, year={1993}, pages={3-37}, language={eng}, issn={1873-2461}, volume={63}, number={1}, note={Elektronische Reproduktion der Druck-Ausgabe 13. Mai 2002 ; Gesehen am 12.06.2023}, journal={Annals of pure and applied logic}, doi={10.1016/0168-0072(93)90206-S}, } @article{UBHD-68476610, author={Ambos-Spies, Klaus and Bakibayev, Timur}, title={Weak completeness notions for exponential time}, year={2019}, pages={1388-1412}, language={eng}, issn={1433-0490}, volume={63}, number={6}, note={Gesehen am 15.01.2020}, journal={Theory of computing systems}, doi={10.1007/s00224-019-09920-4}, } @book{UBHD-66769253, editor={Ambos-Spies, Klaus and Lempp, Steffen and Slaman, Theodore A.}, title={Berechenbarkeitstheorie}, subtitle={21.01. - 27.01.2001}, publisher={Math. Forschungsinst.}, address={Oberwolfach}, year={2001}, pages={16 S.}, language={eng}, number={ARRAY(0x559f10282ce0)}, series={Tagungsbericht / Mathematisches Forschungsinstitut Oberwolfach}, note={Enth. Abstracts der Tagungsbeitr}, library={MA [Signatur: S. Zeitschr.]}, } @book{UBHD-34103298, editor={Ambos-Spies, Klaus}, organization={Workshop on Structure and Complexity <1992, Wadern>}, title={Complexity theory}, subtitle={current research ; [on February 2-8, 1992 a Workshop on Structure and Complexity was held at the Dagstuhl International Conference and Research Center outside the town of Wadern, Germany]}, edition={1. publ.}, publisher={Cambridge Univ. Press}, address={Cambridge [u.a.]}, year={1993}, pages={VIII, 313 S.}, language={eng}, isbn={0-521-44220-6 and 978-0-521-44220-6}, note={Literaturangaben}, keywords={Komplexit{\"a}tstheorie}, library={MA [Signatur: Ambos]}, } @book{UBHD-67566395, editor={Ambos-Spies, Klaus}, organization={Conference on Computability in Europe <5, 2009, Heidelberg>}, title={Computability in Europe 2009}, subtitle={held at Heidelberg, Germany, in July 2009]}, publisher={Elsevier}, address={Amsterdam [u.a.]}, year={2012}, pages={IV S., S. 483 - 619}, language={eng}, number={ARRAY(0x559f102a7778)}, series={Annals of pure and applied logic}, } @book{UBHD-69065698, editor={Ambos-Spies, Klaus}, organization={Conference on Computability Theory <1996, Oberwolfach>}, title={Conference on computability theory}, subtitle={27 January - 3 February 1996, Oberwolfach, Germany}, publisher={North-Holland}, address={Amsterdam [u.a.]}, year={1998}, pages={VI, 296 S.}, language={eng}, number={ARRAY(0x559f102a79a0)}, series={Annals of pure and applied logic}, } @book{UBHD-66833859, editor={Ambos-Spies, Klaus and Merkle, Wolfgang}, organization={Conference on Computability in Europe <5, 2009, Heidelberg>}, title={Mathematical theory and computational practice}, subtitle={5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19 - 24, 2009; Abstract booklet}, publisher={Univ., Dept. of Mathematics and Computer Science, Mathematical Logic and Theoretical Computer Science Group}, address={Heidelberg}, year={2009}, pages={XVI, 360 S.}, language={eng}, library={MA [Signatur: Kongr. 2009/20::[2]]}, } @book{UBHD-66833779, editor={Ambos-Spies, Klaus and L{\"o}we, Benedikt and Merkle, Wolfgang}, organization={Conference on Computability in Europe <5, 2009, Heidelberg>}, title={Mathematical theory and computational practice}, subtitle={5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009 ; proceedings}, publisher={Springer}, address={Berlin ; Heidelberg [u.a.]}, year={2009}, pages={XIV, 510 S.}, language={eng}, isbn={3-642-03072-6 and 978-3-642-03072-7}, number={ARRAY(0x559f10291ba8)}, series={Lecture notes in computer science}, note={Literaturangaben}, keywords={Berechenbarkeit}, library={MA [Signatur: Kongr. 2009/20::[1]]}, } @book{UBHD-69065755, editor={Ambos-Spies, Klaus and L{\"o}we, Benedikt and Merkle, Wolfgang}, title={Mathematical theory and computational practice}, subtitle={5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings}, publisher={Springer Berlin Heidelberg}, address={Berlin, Heidelberg}, year={2009}, pages={Online-Ressource (digital)}, language={eng}, isbn={978-3-642-03073-4}, number={ARRAY(0x559f10254640)}, series={Lecture notes in computer science}, doi={10.1007/978-3-642-03073-4}, keywords={Berechenbarkeit}, } @book{UBHD-69065756, editor={Ambos-Spies, Klaus and M{\"u}ller, Gert H. and Sacks, Gerald E.}, title={Rekursionstheorie}, subtitle={19.3. bis 25.3.1989}, publisher={Math. Forschungsinst.}, address={Oberwolfach}, year={1989}, pages={19 S.}, language={ger and eng}, number={ARRAY(0x559f102c0618)}, series={Tagungsbericht}, doi={10.14760/TB-1989-12}, } @book{UBHD-66726823, editor={Ambos-Spies, Klaus and M{\"u}ller, Gert H. and Sacks, Gerald E.}, title={Rekursionstheorie}, subtitle={19.3. bis 25.3.1989}, publisher={Math. Forschungsinst.}, address={Oberwolfach}, year={1989}, pages={19 S.}, language={ger and eng}, number={ARRAY(0x559f10299b50)}, series={Tagungsbericht / Mathematisches Forschungsinstitut Oberwolfach}, library={MA [Signatur: S. Zeitschr.]}, } @book{UBHD-69065757, editor={Ambos-Spies, Klaus and Sacks, Gerald E. and Soare, Robert I.}, title={Rekursionstheorie}, subtitle={28.01. - 03.02.1996}, publisher={Mathematisches Forschungsinstitut}, address={Oberwolfach-Walke}, year={1996}, pages={21 S.}, language={eng}, number={ARRAY(0x559f1029a480)}, series={Tagungsbericht}, note={Text in engl}, doi={10.14760/TB-1996-5}, } @book{UBHD-66754679, editor={Ambos-Spies, Klaus and Sacks, Gerald E. and Soare, Robert I.}, title={Rekursionstheorie}, subtitle={28.01. - 03.02.1996}, publisher={Mathematisches Forschungsinstitut}, address={Oberwolfach-Walke}, year={1996}, pages={21 S.}, language={eng}, number={ARRAY(0x559f1026fd08)}, series={Tagungsbericht / Mathematisches Forschungsinstitut Oberwolfach}, note={Text in engl}, library={MA [Signatur: S. Zeitschr.]}, } @book{UBHD-69065639, editor={Ambos-Spies, Klaus and L{\"o}we, Benedikt}, title={Special issue: computability in Europe 2009}, subtitle={[... Conference CiE 2009: mathematical theory and computational practice ... Fifth Conference on Computability in Europe ... Heidelberg, Germany, in July 2009 ... 10 papers]}, publisher={Oxford Univ. Press}, address={Oxford}, year={2013}, pages={S. 727 - 924}, language={eng}, number={ARRAY(0x559f102c8d90)}, series={Journal of logic and computation}, }