Computers Aren't Syntax All the Way Down or Content All the Way Up

Date

2018-09-01

Author

Bozşahin, Hüseyin Cem

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

79
views

0
downloads

This paper argues that the idea of a computer is unique. Calculators and analog computers are not different ideas about computers, and nature does not compute by itself. Computers, once clearly defined in all their terms and mechanisms, rather than enumerated by behavioral examples, can be more than instrumental tools in science, and more than source of analogies and taxonomies in philosophy. They can help us understand semantic content and its relation to form. This can be achieved because they have the potential to do more than calculators, which are computers that are designed not to learn. Today's computers are not designed to learn; rather, they are designed to support learning; therefore, any theory of content tested by computers that currently exist must be of an empirical, rather than a formal nature. If they are designed someday to learn, we will see a change in roles, requiring an empirical theory about the Turing architecture's content, using the primitives of learning machines. This way of thinking, which I call the intensional view of computers, avoids the problems of analogies between minds and computers. It focuses on the constitutive properties of computers, such as showing clearly how they can help us avoid the infinite regress in interpretation, and how we can clarify the terms of the suggested mechanisms to facilitate a useful debate. Within the intensional view, syntax and content in the context of computers become two ends of physically realizing correspondence problems in various domains.

Subject Keywords

Computer, Explanation, Semantic content, Learning computers, Correspondence problem

URI

https://hdl.handle.net/11511/30314

Journal

MINDS AND MACHINES

DOI

https://doi.org/10.1007/s11023-018-9469-2

Collections

Graduate School of Informatics, Article

Suggestions

OpenMETU
Core

Computer fault tolerances study inspired by the immune system Canıbek, Atıf Değer; Güran, Hasan; Department of Electrical and Electronics Engineering (2005) Since the advent of computers numerous approaches have been taken to create hardware systems that provide a high degree of reliability even in the presence of errors. This study seeks to address the problem from a biological perspective using the human immune system as a source of inspiration. The immune system uses many ingenious methods to provide reliable operation in the body and so may suggest how similar methods can be used in the design of reliable systems. This study provides a brief introduction in...
2D correlated diffusion process for mobility modeling in mobile networks Çakar, Tunç; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2004) This thesis introduces a novel mobility model based on so called أ2D correlated diffusion processؤ. In this model, motion components over x and y axes are dependent. Joint density function of the process is derived. The expected exit time from an arbitrary domain is characterized by a boundary value problem. Analytical solution of this problem is given for a specific case. Numerical solution of the problem is presented by several examples. The results obtained in these examples are verified by simulations. ...
Computer-aided limit states analysis of bridge abutments Dicleli, Murat (2001-12-01) This paper presents a computer program developed for limit states analysis of abutments. The program can perform both structural and geotechnical analysis of bridge abutments and check their resistances in compliance with limit states design criteria. In the program, the earth pressure coefficient for the backfill soil is calculated as a function of abutment’s lateral non-linear displacement. Therefore, for abutments partially restrained against lateral movement, an earth pressure coefficient less than that...
Clustering frequent navigation patterns from website logs using ontology and temporal information Kılıç, Sefa; Karagöz, Pınar; Toroslu, İsmail Hakkı; Department of Computer Engineering (2011) Given set of web pages labeled with ontological items, the level of similarity between two web pages is measured using the level of similarity between ontological items of pages labeled with. Using similarity measure between two pages, degree of similarity between two sequences of web page visits can be calculated as well. Using clustering algorithms, similar frequent sequences are grouped and representative sequences are selected from these groups. A new sequence is compared with all clusters and it is ass...
Machine learning methods for opponent modeling in games of imperfect information Şirin, Volkan; Yarman Vural, Fatoş Tunay; Department of Computer Engineering (2012) This thesis presents a machine learning approach to the problem of opponent modeling in games of imperfect information. The efficiency of various artificial intelligence techniques are investigated in this domain. A sequential game is called imperfect information game if players do not have all the information about the current state of the game. A very popular example is the Texas Holdem Poker, which is used for realization of the suggested methods in this thesis. Opponent modeling is the system that enabl...

Citation Formats

H. C. Bozşahin, “Computers Aren’t Syntax All the Way Down or Content All the Way Up,” MINDS AND MACHINES, pp. 543–567, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30314.