On the structural simplicity of machines and languages
type: Item
instance of: scholarly article
title: On the structural simplicity of machines and languages
zbMATH Open document ID: 0858.68019
DOI: 10.1007/BF01536402
author: Yael Moscowitz
author: Ehud Shapiro
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 937280
zbMATH Keywords: computational complexity boundaries
zbMATH Keywords: Turing machines
MaRDI profile type: Publication
cites work: Fixpoint logics, relational machines, and computational complexity
cites work: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
cites work: Program Schemes with Pushdown Stores
cites work: Alternation
cites work: On Classes of Program Schemata
cites work: Q4038658
cites work: Propositional dynamic logic of regular programs
cites work: Q3212265
cites work: Q3975134
cites work: Q3997501
cites work: Q4027616
cites work: The next 700 programming languages
cites work: Q4185781
cites work: Alternation and the computational complexity of logic programs
full work available at URL: https://doi.org/10.1007/bf01536402
OpenAlex ID: W2077948888
description: scientific article; zbMATH DE number 937280