{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:26:47Z","timestamp":1740108407226,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006211","name":"Humboldt-Universit\u00e4t zu Berlin","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006211","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:title>Zusammenfassung<\/jats:title><jats:p>In diesem Beitrag frage ich nach einem Rahmen f\u00fcr eine umfassende Theorie der Informatik als eine formale Theorie der diskreten dynamischen Systeme, nach dem Vorbild der Theoriebildung in den Naturwissenschaften. An zahlreichen Beispielen zeige ich, dass dieses Unterfangen durchaus aussichtsreich ist und in isolierten Teilen schon vorliegt. Auf lange Sicht k\u00f6nnte die Informatik damit eine eigenst\u00e4ndige Wissenschaft herausbilden, in Erg\u00e4nzung zu ihren starken technologischen Aspekten, mit eigener theoretischer, mathematischer Basis, und auf Augenh\u00f6he mit den Naturwissenschaften.<\/jats:p>","DOI":"10.1007\/s00287-020-01294-z","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T11:03:50Z","timestamp":1596193430000},"page":"262-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Informatik \u2013 eine eigenst\u00e4ndige Wissenschaft?"],"prefix":"10.1007","volume":"43","author":[{"given":"Wolfgang","family":"Reisig","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"1294_CR1","unstructured":"https:\/\/www.omg.org\/spec\/BPMN\/2.0\/. Zugegriffen: 9.3.2020"},{"key":"1294_CR2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors: a model of concurrent computation in distributed systems","author":"G Agha","year":"1986","unstructured":"Agha\u00a0G (1986) Actors: a model of concurrent computation in distributed systems. MIT Press, Cambridge, MA"},{"key":"1294_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement calculus","author":"R Back","year":"1998","unstructured":"Back\u00a0R, Wright\u00a0J (1998) Refinement calculus. Springer, New York"},{"key":"1294_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-75632-5_1","volume-title":"Lectures on runtime verification. Introductory and advanced topics","author":"E Bartocci","year":"2018","unstructured":"Bartocci\u00a0E, Falcone\u00a0Y, Francalanza\u00a0A, Reger\u00a0G (2018) Introduction to runtime verification. In: Lectures on runtime verification. Introductory and advanced topics. Lecture notes in computer science, Bd. 10457. Springer, Cham, S\u00a01\u201333"},{"key":"1294_CR5","volume-title":"Proc. ACM-POPL","author":"G Berry","year":"1990","unstructured":"Berry\u00a0G, Boudol\u00a0G (1990) The chemical abstract machine. In: Proc. ACM-POPL"},{"key":"1294_CR6","volume-title":"The unified modeling language user guide","author":"G Booch","year":"2005","unstructured":"Booch\u00a0G, Rumbaugh\u00a0J, Jacobson\u00a0I (2005) The unified modeling language user guide, 2.\u00a0Aufl. Addison Wesley, Boston","edition":"2"},{"key":"1294_CR7","unstructured":"Brennecke A, Keil-Slawik R (1996) (Hrsg) Position Papers for Dagstuhl Seminar 9635 on History of Software Engineering"},{"volume-title":"Understanding Moore\u2019s law: four decades of innovation","year":"2006","key":"1294_CR8","unstructured":"Brock\u00a0DC (Hrsg) (2006) Understanding Moore\u2019s law: four decades of innovation. Chemical Heritage Foundation, Philadelphia"},{"key":"1294_CR9","volume-title":"SOFSEM 98","author":"M Broy","year":"1998","unstructured":"Broy\u00a0M (1998) A logical basis for modular software and systems engineering. In: SOFSEM 98"},{"key":"1294_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0091-5","volume-title":"Specification and development of interactive systems","author":"M Broy","year":"2001","unstructured":"Broy\u00a0M, Stolen\u00a0K (2001) Specification and development of interactive systems. Springer, New York"},{"issue":"4","key":"1294_CR11","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/0167-8191(94)90032-9","volume":"20","author":"N Carriero","year":"1994","unstructured":"Carriero\u00a0N, Gelernter\u00a0D, Mattson\u00a0T, Sherman\u00a0A (1994) The Linda alternative to message-passing systems. Parallel Comput 20(4):633\u2013655","journal-title":"Parallel Comput"},{"issue":"3","key":"1294_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00976283","volume":"3","author":"CE Cleland","year":"1993","unstructured":"Cleland\u00a0CE (1993) Is the Church-Turing thesis true? Minds Mach 3(3):283\u2013312","journal-title":"Minds Mach"},{"issue":"2","key":"1294_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1093\/comjnl\/bxl062","volume":"50","author":"P Cockshott","year":"2007","unstructured":"Cockshott\u00a0P, Michaelson\u00a0G (2007) Are there new models of computation? Reply to Wegner and Eberbach. Computer\u00a0J 50(2):232\u2013247. https:\/\/doi.org\/10.1093\/comjnl\/bxl062","journal-title":"Eberbach. Computer\u00a0J"},{"key":"1294_CR14","series-title":"LNCS","volume-title":"Proceedings of computability in Europe","author":"N Dershowitz","year":"2014","unstructured":"Dershowitz\u00a0N, Falkovich\u00a0E (2014) Generic parallel algorithms. In: Proceedings of computability in Europe. LNCS, Bd. 8493"},{"key":"1294_CR15","volume-title":"The distinguished lecture series, academic leaders in computer science and electrical engineering","author":"EW Dijkstra","year":"1990","unstructured":"Dijkstra\u00a0EW (1990) Reasoning about programs. In: The distinguished lecture series, academic leaders in computer science and electrical engineering, Bd. III. University Video Communications, Stanford"},{"key":"1294_CR16","doi-asserted-by":"publisher","DOI":"10.1145\/2506375","author":"CA Furia","year":"2014","unstructured":"Furia\u00a0CA, Meyer\u00a0B, Velder\u00a0S (2014) Loop Invariants: analysis, classification, and examples. Acm Comput Suveys. https:\/\/doi.org\/10.1145\/2506375","journal-title":"Acm Comput Suveys"},{"key":"1294_CR17","volume-title":"Handbook of process algebra","author":"RJ van Glabbeek","year":"2001","unstructured":"van Glabbeek\u00a0RJ (2001) The linear time \u2013 branching time spectrum I: the semantics of concrete, sequential processes. In: Handbook of process algebra. Elsevier, Amsterdam (chapter 1)"},{"key":"1294_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The science of programming","author":"D Gries","year":"1981","unstructured":"Gries\u00a0D (1981) The science of programming. Springer, New York"},{"key":"1294_CR19","doi-asserted-by":"publisher","DOI":"10.1145\/343369.343384","author":"Y Gurevich","year":"2000","unstructured":"Gurevich\u00a0Y (2000) Sequential abstract state machines capture sequential algorithms. ACM Trans Comput Log. https:\/\/doi.org\/10.1145\/343369.343384","journal-title":"ACM Trans Comput Log"},{"key":"1294_CR20","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare CAR (1969) An axiomatic basis for computer programming. CACM 12:576\u2013583","journal-title":"CACM"},{"key":"1294_CR21","series-title":"Edsger W. Dijkstra Memorial Lecture","volume-title":"What can we learn from Edsger W. Dijkstra?","author":"T Hoare","year":"2010","unstructured":"Hoare\u00a0T (2010) What can we learn from Edsger W. Dijkstra? Austin Texas, 12. Okt. 2010. Edsger W. Dijkstra Memorial Lecture"},{"key":"1294_CR22","volume-title":"The art of computer programming","author":"DE Knuth","year":"1973","unstructured":"Knuth\u00a0DE (1973) The art of computer programming Bd. 1. Addison-Wesley, Boston"},{"key":"1294_CR23","unstructured":"K\u00fcster-Filipe J (2000) Fundamentals of a\u00a0module logic for distributed object systems. J\u00a0Funct Log Program 200(3):52\u201362"},{"key":"1294_CR24","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563","author":"L Lamport","year":"1978","unstructured":"Lamport L (1978) Time, clocks, and the ordering of events in a\u00a0distributed system. Commun ACM 21(7). https:\/\/doi.org\/10.1145\/359545.359563","journal-title":"Commun ACM"},{"key":"1294_CR25","volume-title":"Specifying systems","author":"L Lamport","year":"2002","unstructured":"Lamport\u00a0L (2002) Specifying systems. Addison-Wesley, Boston"},{"key":"1294_CR26","volume-title":"Is God a\u00a0Mathematician?","author":"M Livio","year":"2009","unstructured":"Livio\u00a0M (2009) Is God a\u00a0Mathematician? Simon & Schuster, New York"},{"key":"1294_CR27","first-page":"21","volume-title":"Proc. IFIP Congress 62","author":"J McCarthy","year":"1963","unstructured":"McCarthy\u00a0J (1963) Towards a\u00a0mathematical science of computation. In: Proc. IFIP Congress 62. North-Holland, Amsterdam, S 21"},{"key":"1294_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.09.009","author":"RM McConnell","year":"2011","unstructured":"McConnell RM, Mehlhorn K, N\u00e4her S, Schweitzer P (2011) Certifying algorithms. Comput Sci Rev. https:\/\/doi.org\/10.1016\/j.cosrev.2010.09.009","journal-title":"Comput Sci Rev"},{"key":"1294_CR29","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1308\/147363505X17756","volume":"87","author":"R Milner","year":"2005","unstructured":"Milner R (2005) Software science: from virtual to reality. Bull EATCS 87:12\u201316","journal-title":"Bull EATCS"},{"volume-title":"Software Engineering: Report of a\u00a0conference sponsored by the NATO Science Committee, Garmisch, Germany, 7\u201311 Oct. 1968","year":"1969","key":"1294_CR30","unstructured":"Naur\u00a0P, Randell\u00a0B (Hrsg) (1969) Software Engineering: Report of a\u00a0conference sponsored by the NATO Science Committee, Garmisch, Germany, 7\u201311 Oct. 1968. NATO Scientific Affairs Division, Br\u00fcssel"},{"key":"1294_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33278-4","volume-title":"Understanding Petri nets","author":"W Reisig","year":"2013","unstructured":"Reisig\u00a0W (2013) Understanding Petri nets. Springer, Berlin, Heidelberg"},{"key":"1294_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-018-0328-7","author":"W Reisig","year":"2019","unstructured":"Reisig\u00a0W (2019) Associative composition of components with double-sided interfaces. Acta Inform. https:\/\/doi.org\/10.1007\/s00236-018-0328-7","journal-title":"Acta Inform"},{"key":"1294_CR33","volume-title":"Mechanisms for computing over arbitrary structures. The universal Turing-machine","author":"JC Shepherdson","year":"1995","unstructured":"Shepherdson\u00a0JC (1995) Mechanisms for computing over arbitrary structures. The universal Turing-machine"},{"key":"1294_CR34","series-title":"International series in computer science","volume-title":"The Z notation: a reference manual","author":"JM Spivey","year":"1992","unstructured":"Spivey\u00a0JM (1992) The Z notation: a reference manual, 2.\u00a0Aufl. International series in computer science. Prentice Hall, Upper Saddle River, New Jersey","edition":"2"},{"key":"1294_CR35","volume-title":"Interactive computation \u2013 the new paradigm","author":"LA Stein","year":"2005","unstructured":"Stein\u00a0LA (2005) Interaction, computation, and education. In: Goldin\u00a0D et\u00a0al (Hrsg) Interactive computation \u2013 the new paradigm. Springer, Berlin, Heidelberg"},{"key":"1294_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to distributed algorithms","author":"G Tel","year":"2000","unstructured":"Tel\u00a0G (2000) Introduction to distributed algorithms, 2.\u00a0Aufl. Cambridge University Press, Cambridge, UK","edition":"2"},{"key":"1294_CR37","volume-title":"Computable functions and semicomputable sets on many-sorted algebras. Handbook of logic in computer science","author":"JV Tucker","year":"2000","unstructured":"Tucker\u00a0JV, Zucker\u00a0JI (2000) Computable functions and semicomputable sets on many-sorted algebras. Handbook of logic in computer science. Oxford University Press, Oxford"},{"key":"1294_CR38","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-42.1.230","author":"A Turing","year":"1937","unstructured":"Turing A (1937) On computable numbers, with an application to the Entscheidungsproblem. Proc Lond Math Soc 42. https:\/\/doi.org\/10.1112\/plms\/s2-42.1.230","journal-title":"Proc Lond Math Soc"},{"key":"1294_CR39","volume-title":"2nd ACM conference on computing frontiers","author":"PMB Vitanyi","year":"2005","unstructured":"Vitanyi\u00a0PMB (2005) Time, space, and energy in reversible computing. In: 2nd ACM conference on computing frontiers"},{"key":"1294_CR40","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/253769.253801","volume":"40","author":"P Wegner","year":"1997","unstructured":"Wegner\u00a0P (1997) Why interaction is more powerful than algorithms. CACM 40:80\u201391","journal-title":"CACM"},{"issue":"1","key":"1294_CR41","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1093\/comjnl\/47.1.4","volume":"47","author":"P Wegner","year":"2004","unstructured":"Wegner\u00a0P, Eberbach\u00a0E (2004) New Models of Computation. Comput\u00a0J 47(1):4\u20139","journal-title":"Comput J"},{"key":"1294_CR42","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2011.12.040","volume":"429","author":"J van Leuven","year":"2012","unstructured":"van Leuven J, Wiedermann J (2012) Computation as an unbounded process. Theor Comput Sci 429:202\u2013212","journal-title":"Theor Comput Sci"},{"key":"1294_CR43","volume-title":"What is computation Proc. 6th AISB Symp on Computing and Philosophy","author":"J van Leuven","year":"2013","unstructured":"van Leuven\u00a0J, Wiedermann\u00a0J (2013) Rethinking computation. In: Brown\u00a0M, Erden\u00a0Y (Hrsg) What is computation Proc. 6th AISB Symp on Computing and Philosophy AISB Convention 2013."},{"key":"1294_CR44","volume-title":"Proc. 6th AISB Symp on Computing and Philosophy","author":"J van Leuven","year":"2014","unstructured":"van Leuven\u00a0J, Wiedermann\u00a0J (2014) Computation as knowledge generation, with application to the observer-relativity problem. In: Brown\u00a0M, Erden\u00a0Y (Hrsg) Proc. 6th AISB Symp on Computing and Philosophy AISB 50 Convention, London"},{"key":"1294_CR45","volume-title":"Mathematics unlimited \u2013 2001 and beyond","author":"YN Moschovakis","year":"2001","unstructured":"Moschovakis\u00a0YN (2001) What is an Algorithm? In: Enquist\u00a0B, Schmidt\u00a0W (Hrsg) Mathematics unlimited \u2013 2001 and beyond. Springer, Berlin, Heidelberg"},{"key":"1294_CR46","doi-asserted-by":"publisher","first-page":"1881","DOI":"10.1098\/rsta.2008.0118","volume":"366","author":"JM Wing","year":"2008","unstructured":"Wing\u00a0JM (2008) Computational thinking and thinking about computing. Phil Trans R Soc\u00a0A 366:1881","journal-title":"Phil Trans R Soc A"}],"container-title":["Informatik Spektrum"],"original-title":[],"language":"de","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-020-01294-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00287-020-01294-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-020-01294-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T23:44:37Z","timestamp":1627688677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00287-020-01294-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["1294"],"URL":"https:\/\/doi.org\/10.1007\/s00287-020-01294-z","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"type":"print","value":"0170-6012"},{"type":"electronic","value":"1432-122X"}],"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"31 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}