Journal Article

Analogicity in Computer Science. Methodological Analysis

Stacewicz, Paweł

2020

Overview

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.

• Publisher: Sciendo,De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
• Subject: analogicity / analogousness / analogue computations / Computer science / hypercomputations / methodology of computer science / natural computations