Interactive Machines and Its Implication in Scientific Realism

DOI

10.2991/assehr.k.211220.485How to use a DOI?

Keywords

Computer Science; Interactive Machine; Scientific Realism; Philosophy; Logic

Abstract

Since the tech boom in the early 2000s, computer science, especially the study of algorithms and mathematics, has been prevalent to satisfy new needs for efficiency and convenience. The founding father of modern computer science, Alan Turing, proposes the foundation of modern computability theories known as the Turing Machine. This article is dedicated to exploring a variant of Turing’s mathematical model, where the inputs become infinite and empirical. In a way, it is also an exploration of whether theoretically a true interactive machine can be achieved through a finite number of noninteractive machines. To prove it possible, this article utilizes methods such as researching from established papers, proof by deduction, and mathematical induction. In terms of articles, the main source is JSTOR. As the proof goes, it is mathematically proven in this essay that in terms of generic case K, an Interactive Machine A(K) shares the same explanatory equivalence with a finite number of Turing Machines T(K). It is said that A maps onto T.

Copyright

© 2021 The Authors. Published by Atlantis Press SARL.

Open Access

This is an open access article under the CC BY-NC license.

Download article (PDF)

TY  - CONF
AU  - Shuai Han
PY  - 2021
DA  - 2021/12/24
TI  - Interactive Machines and Its Implication in Scientific Realism
BT  - Proceedings of the 2021 4th International Conference on Humanities Education and Social Sciences (ICHESS 2021)
PB  - Atlantis Press
SP  - 2803
EP  - 2807
SN  - 2352-5398
UR  - https://doi.org/10.2991/assehr.k.211220.485
DO  - 10.2991/assehr.k.211220.485
ID  - Han2021
ER  -