Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers
Jan A. Bergstra

TL;DR
This paper investigates the expressiveness of instruction sequence classes for computation over single bit registers, introducing a quantitative measure based on instruction count and analyzing their properties.
Contribution
It develops a new notion of quantitative expressiveness and interface for instruction sequences, providing foundational properties for classes operating on single bit registers.
Findings
Established elementary properties of instruction sequence classes
Developed a dedicated interface concept for instruction sequences
Analyzed expressiveness in terms of instruction count (LLOC)
Abstract
The number of instructions of an instruction sequence is taken for its logical SLOC, and is abbreviated with LLOC. A notion of quantitative expressiveness is based on LLOC and in the special case of operation over a family of single bit registers a collection of elementary properties are established. A dedicated notion of interface is developed and is used for stating relevant properties of classes of instruction sequences
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Numerical Methods and Algorithms · Algorithms and Data Compression
