On Algorithm Schemata which are Defined on Situations

R. I. Podlovchenko

A chapter in Systems Theory Research, 1973, pp 225-258 from Springer

Abstract: Abstract The notion of a memory consisting of individual cells and the notion of a memory state consisting of states of cells play a fundamental role in programming theory. At the same time, in certain branches of this theory, information on memory structure turns out to be redundant, and the memory state is perceived as a unified element. In this case memory may not be introduced at all, and the set of memory states may be considered as a set of abstract “situations.”

Date: 1973
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-0079-4_10

Ordering information: This item can be ordered from
http://www.springer.com/9781475700794

DOI: 10.1007/978-1-4757-0079-4_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().