NDLI: Ordinary interactive small-step algorithms, II

Content Provider	ACM Digital Library
Author	Gurevich, Yuri Blass, Andreas
Copyright Year	2007
Abstract	This is the second in a series of three articles extending the proof of the Abstract State Machine Thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments during a step, rather than only between steps. As in the first article of the series, we are concerned here with ordinary, small-step, interactive algorithms. This means that the algorithms: (1) proceed in discrete, global steps, (2) perform only a bounded amount of work in each step, (3) use only such information from the environment as can be regarded as answers to queries, and (4) never complete a step until all queries from that step have been answered. After reviewing the previous article's formal description of such algorithms and the definition of behavioral equivalence, we define ordinary, interactive, small-step abstract state machines (ASMs). Except for very minor modifications, these are the machines commonly used in the ASM literature. We define their semantics in the framework of ordinary algorithms and show that they satisfy the postulates for these algorithms. This material lays the groundwork for the final article in the series, in which we shall prove the Abstract State Machine thesis for ordinary, intractive, small-step algorithms: All such algorithms are equivalent to ASMs.
File Format	PDF
ISSN	15293785
e-ISSN	1557945X
DOI	10.1145/1243996.1243998
Volume Number	8
Issue Number	3
Journal	ACM Transactions on Computational Logic (TOCL)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-07-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Sequential algorithms Abstract state machines Equivalence of algorithms Interaction Postulates
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Logic Computational Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Ordinary interactive small-step algorithms, I

Ordinary interactive small-step algorithms, III

Persistent queries in the behavioral theory of algorithms

Abstract state machines capture parallel algorithms

Sequential abstract-state machines capture sequential algorithms

Abstract state machines capture parallel algorithms: Correction and extension

Ordinary Interactive Small-Step Algorithms, II (2007)

Tan-Like State Assignments ror Synchronous Sequential Machines

Propositional computability logic II

Ordinary interactive small-step algorithms, II

Similar Documents

Ordinary interactive small-step algorithms, I

Ordinary interactive small-step algorithms, III

Persistent queries in the behavioral theory of algorithms

Abstract state machines capture parallel algorithms

Sequential abstract-state machines capture sequential algorithms

Abstract state machines capture parallel algorithms: Correction and extension

Ordinary Interactive Small-Step Algorithms, II (2007)

Tan-Like State Assignments ror Synchronous Sequential Machines

Propositional computability logic II

Ordinary interactive small-step algorithms, II