Affordable Access

Publisher Website

Execution architectures for program algebra

Authors
Journal
Journal of Applied Logic
1570-8683
Publisher
Elsevier
Publication Date
Volume
5
Issue
1
Identifiers
DOI: 10.1016/j.jal.2005.10.013
Keywords
  • Halting Problem
  • Execution Of Programs
  • Program Algebra
  • Turing Machine
Disciplines
  • Design
  • Linguistics
  • Mathematics

Abstract

Abstract We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purpose of explanation and provided with a process-algebraic, compositional semantics, and synthetic architectures, focusing on how a program may be a physical part of an execution architecture. Then we discuss in detail the Turing machine, a well-known example of an analytic architecture. The logical core of the halting problem—the inability to forecast termination behavior of programs—leads us to a few approaches and examples on related issues: forecasters and rational agents. In particular, we consider architectures suitable to run a Newcomb Paradox system and the Prisoner's Dilemma.

There are no comments yet on this publication. Be the first to share your thoughts.