Expressiveness, meanings and machines

DOI10.3233/COM-180090zbMATH Open1417.68031OpenAlexW2800624067WikidataQ129871652 ScholiaQ129871652MaRDI QIDQ4628355FDOQ4628355

Authors: Joe Davidson, Greg Michaelson 

Publication date: 20 March 2019

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-180090

Recommendations

• scientific article; zbMATH DE number 177780
• On the structural simplicity of machines and languages
• On the expressive power of programming languages
• On abstraction and the expressive power of programming languages
• Quantitative expressiveness of instruction sequence classes for computation on single bit registers

zbMATH Keywords

semanticsexpressivenessTuring machinecomputabilityFPGAprimitive recursioneleganceRASP machine universality

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cited In (2)

• Title not available (Why is that?)
• Expression and guidance in Schroeder's expressivist semantics

This page was built for publication: Expressiveness, meanings and machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628355)