04007nam 2200505 450 991048383380332120220205090923.03-030-59234-010.1007/978-3-030-59234-9(CKB)4100000011954395(DE-He213)978-3-030-59234-9(MiAaPQ)EBC6637856(Au-PeEL)EBL6637856(OCoLC)1257083902(PPN)260306738(EXLCZ)99410000001195439520220205d2021 uy 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierHandbook of computability and complexity in analysis /Vasco Brattka, Peter Hertling, editors1st ed. 2021.Cham, Switzerland :Springer,[2021]©20211 online resource (XXV, 427 p.) Theory and applications of computability3-030-59233-2 Includes bibliographical references and index.Part I, Computability in Analysis -- Computability of Real Numbers -- Computability of Subsets of Metric Spaces -- Computability of Differential Equations -- Computable Complex Analysis -- Part II, Complexity, Dynamics, and Randomness -- Computable Geometric Complex Analysis and Complex Dynamics -- A Survey on Analog Models of Computation -- Computable Measure Theory and Algorithmic Randomness -- Algorithmic Fractal Dimensions in Geometric Measure Theory -- Part III Constructivity, Logic, and Descriptive Complexity -- Admissibly Represented Spaces and Qcb-Spaces -- Bishop-Style Constructive Reverse Mathematics -- Weihrauch Complexity in Computable Analysis -- Index.Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means? Nowadays, this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades, computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology. This comprehensive handbook contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, as well as a wealth of information and references that will help them to navigate the modern research literature in this field. Vasco Brattka is a professor for Theoretical Computer Science and Mathematical Logic at the Universität der Bundeswehr München. He is editor-in-chief of Computability, the journal of the association, Computability in Europe. Peter Hertling is a professor in the Institute for Theoretical Computer Science, Mathematics and Operations Research at UniBwM. He is an associate editor of Journal of Complexity.Theory and applications of computability.Computer scienceMathematicsComputer scienceMathematics.004.0151Brattka Vasco1966-Hertling Peter1965-MiAaPQMiAaPQMiAaPQBOOK9910483833803321Handbook of Computability and Complexity in Analysis1892942UNINA02742nam 2200565 450 991081448860332120200520144314.03-11-052391-43-11-052369-810.1515/9783110523690(CKB)4340000000190831(DE-B1597)474229(OCoLC)1000149286(OCoLC)1001379993(OCoLC)1003245915(DE-B1597)9783110523690(Au-PeEL)EBL4911738(CaPaEBR)ebr11423759(CaSebORM)9783110523911(MiAaPQ)EBC4911738(EXLCZ)99434000000019083120170914h20172017 uy 0gerurcnu||||||||rdacontentrdamediardacarrierVorkurs in Wirtschaftsmathematik /Jutta Arrenberg [and three others]5., vollstandig berarbeitete und aktualisierte Auflage.Oldenburg, [Germany] :De Gruyter,2017.©20171 online resource (186 pages) illustrationsDe Gruyter StudiumIncludes index.3-11-052368-X Frontmatter -- Vorwort -- Inhaltsverzeichnis -- 1. Lern- und Arbeitsanleitung -- 2. Rechnen mit reellen Zahlen -- 3. Aussagenlogik -- 4. Mengenlehre -- 5. Abzählmethoden -- 6. Potenzen -- 7. Wurzeln -- 8. Logarithmen -- 9. Terme und Termumformungen -- 10. Gleichungen und Ungleichungen -- 11. Funktionen -- 12. Nachtest -- StichwortverzeichnisIn diesem Lehrbuch werden grundlegende Begriffe und Techniken der Mathematik anhand von Beispielen erläutert. Mithilfe von Aufgaben kann das vermittelte Wissen erprobt und vertieft werden. Das Buch umfasst die Bereiche Grundrechenarten (auch mit Variablen), Potenzen, Wurzeln, Logarithmen, binomische Formeln sowie Aussagenlogik, Mengenlehre, Abzählmethoden der Kombinatorik, Funktionen, Gleichungen und Ungleichungen. Der Vorkurs hilft, Lücken zwischen vorhandenem Wissen und den Anforderungen des Studiums zu schließen. Das Buch richtet sich an Studierende vor Antritt eines Studiums sowie an Lehrende der Wirtschaftswissenschaften und anderer wirtschaftsbezogener Studiengänge an Hochschulen und Akademien. Business mathematicsStudy and teachingBusiness mathematicsStudy and teaching.650.01513QH 110rvkArrenberg Jutta, 1040974Arrenberg Jutta MiAaPQMiAaPQMiAaPQBOOK9910814488603321Vorkurs in Wirtschaftsmathematik2663505UNINA01043nam 2200373 450 991080853120332120210224145318.01-80043-380-8(MiAaPQ)EBC6357744(Au-PeEL)EBL6357744(OCoLC)1202460878(EXLCZ)99410000001147602220210224d2020 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierAgile business leadership methods for industry 4.0 /edited by Bulent AkkayaBingley, England :Emerald Publishing,[2020]20201 online resource (420 pages)1-80043-381-6 LeadershipLeadership.658.4092Akkaya BulentMiAaPQMiAaPQMiAaPQBOOK9910808531203321Agile business leadership methods for industry 4.04060847UNINA