Random-access stored-program machine
Semantic Scholar uses AI to extract papers important to this topic.
- Int. J. Found. Comput. Sci.
machine for modular imperative agent-based modeling This section provides an abstract machine specification for the modular… (More)
The scientific study of programming languages requires a formal specification of their semantics. However, the incentives of… (More)
ion Abstraktion Acceptance problem Akzeptanz-Problem Accepted akzeptiert Accepting state akzeptierender Zustand Ackermann… (More)
Chaitin’s notion of program elegance, that is of the smallest program to satisfy some specification, does not explicitly take… (More)
Weight and cardinality constraints constitute a very useful programming construct widely adopted in Answer Set Programming (ASP… (More)
In this paper, we extend our previous work on Resourced ASP, or for short RASP, where we have introduced the possibility of… (More)
In 1964, Elgot and Robinson introduced the Random-Access Stored Program (RASP) machine model “to capture some of the most salient… (More)
- Mathematical systems theory
In this paper we explore the computational complexity measure defined by running times of programs on random access stored… (More)
A new class of machine models as a framework for the rational discussion of programming languages is introduced. In particular, a… (More)