<abstract xmlns="http://www.w3.org/1999/xhtml"><p>Analogicity in computer science is understood in two, not mutually exclusive ways: 1) with regard to the continuity feature (of data or computations), 2) with regard to the analogousness feature (i.e. similarity between certain natural processes and computations). Continuous computations are the subject of three methodological questions considered in the paper: 1a) to what extent do their theoretical models go beyond the model of the universal Turing machine (defining digital computations), 1b) is their computational power greater than that of the universal Turing machine, 1c) under what conditions are continuous computations realizable in practice? The analogue-analogical computations lead to two other issues: 2a) in what sense and to what extent their accuracy depends on the adequacy of certain theories of empirical sciences, 2b) are there analogue-analogical computations in nature that are also continuous? The above issues are an important element of the philosophical discussion on the limitations of contemporary computer science.</p></abstract>

Analogicity in computer science is understood in two, not mutually exclusive ways: 1) with regard to the continuity feature (of data or computations), 2) with regard to the analogousness feature (i.e. similarity between certain natural processes and computations). Continuous computations are the subject of three methodological questions considered in the paper: 1a) to what extent do their theoretical models go beyond the model of the universal Turing machine (defining digital computations), 1b) is their computational power greater than that of the universal Turing machine, 1c) under what conditions are continuous computations realizable in practice? The analogue-analogical computations lead to two other issues: 2a) in what sense and to what extent their accuracy depends on the adequacy of certain theories of empirical sciences, 2b) are there analogue-analogical computations in nature that are also continuous? The above issues are an important element of the philosophical discussion on the limitations of contemporary computer science.

Analogicity in Computer Science. Methodological Analysis

Faculty of Administration and Social Sciences, International Center for Formal Ontology

Studies in Logic, Grammar and Rhetoric

This work is licensed under the Creative Commons Attribution 4.0 International License.

{"article-title":"Analogicity in Computer Science. Methodological Analysis"}

Analogicity in computer science is understood in two, not mutually exclusive ways: 1) with regard to the continuity feature (of data or computations), 2) with...

Analogicity in Computer Science. Methodological Analysis

Published Online: Nov 04, 2020

Page range: 69 - 86

DOI: https://doi.org/10.2478/slgr-2020-0028

Keywords
computer science, methodology of computer science, analogicity, analogue computations, analogousness, natural computations, hypercomputations

© 2020 Paweł Stacewicz, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Analogicity in Computer Science. Methodological Analysis

Published Online: Nov 04, 2020

Page range: 69 - 86

DOI: https://doi.org/10.2478/slgr-2020-0028

Keywordscomputer science, methodology of computer science, analogicity, analogue computations, analogousness, natural computations, hypercomputations

© 2020 Paweł Stacewicz, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Keywords
computer science, methodology of computer science, analogicity, analogue computations, analogousness, natural computations, hypercomputations