Instruction sequences for computer science. (Q441056)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Instruction sequences for computer science. |
scientific article; zbMATH DE number 6068584
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Instruction sequences for computer science. |
scientific article; zbMATH DE number 6068584 |
Statements
Instruction sequences for computer science. (English)
0 references
20 August 2012
0 references
instruction sequences
0 references
SPISA
0 references
process algebra
0 references
This book concerns instruction sequences, the behaviours produced by instruction sequences under execution the interaction between these behaviours and components of the execution environment concerning the processing of instructions, the expressiveness of instruction sequences, and various issues relating to well-known subjects from computer science. Most of the issues in question are of a computation-theoretic or computer-architectural kind. They relate to subjects such as the halting problem, non-uniform computational complexity, instruction sequence performance and instruction set architecture. Some of the issues considered are somehow related to process algebra, namely remote instruction processing and instruction sequence producible processes. Some variations on instruction sequences of the usual kind, such as instruction sequences without a directional bias and probabilistic instruction sequences, are also considered.NEWLINENEWLINE This book is primarily intended for researchers in computer science interested in instruction sequences as a theme in computer science. It is also meant to be suitable as supplementary reading in courses for graduate students and advanced undergraduate students in computer science.
0 references