Jump to ContentJump to Main Navigation
Computation, Dynamics, and Cognition$
Users without a subscription are not able to see the full content.

Marco Giunti

Print publication date: 1997

Print ISBN-13: 9780195090093

Published to Oxford Scholarship Online: November 2020

DOI: 10.1093/oso/9780195090093.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 27 October 2021

Generalized Computational Systems

Generalized Computational Systems

Chapter:
(p.55) Two Generalized Computational Systems
Source:
Computation, Dynamics, and Cognition
Author(s):

Marco Giunti

Publisher:
Oxford University Press
DOI:10.1093/oso/9780195090093.003.0006

The definition of a computational system that I proposed in chapter 1 (definition 3) employs the concept of Turing computability. In this chapter, however, I will show that this concept is not absolute, but instead depends on the relational structure of the support on which Turing machines operate. Ordinary Turing machines operate on a linear tape divided into a countably infinite number of adjacent squares. But one can also think of Turing machines that operate on different supports. For example, we can let a Turing machine work on an infinite checkerboard or, more generally, on some n-dimensional infinite array. I call an arbitrary support on which a Turing machine can operate a pattern field. Depending on the pattern field F we choose, we in fact obtain different concepts of computability. At the end of this chapter (section 6), I will thus propose a new definition of a computational system (a computational system on pattern field F) that takes into account the relativity of the concept of Turing computability. If F is a doubly infinite tape, however, computational systems on F reduce to computational systems. Turing (1965) presented his machines as an idealization of a human being that transforms symbols by means of a specified set of rules. Turing based his analysis on four hypotheses: 1. The capacity to recognize, transform, and memorize symbols and rules is finite. It thus follows that any transformation of a complex symbol must always be reduced to a series of simpler transformations. These operations on elementary symbols are of three types: recognizing a symbol, replacing a symbol, and shifting the attention to a symbol that is contiguous to the symbol which has been considered earlier. 2. The series of elementary operations that are in fact executed is determined by three factors: first, the subject’s mental state at a given time; second, the symbol which the subject considers at that time; third, a rule chosen from a finite number of alternatives.

Keywords:   abacus machine, cascade, decoding, extended alphabet, format for a computation, pattern field

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .