scientific article

zbMath0443.68021MaRDI QIDQ3886851

Frank S. Beckman

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Turing machinesconstructive mathematicssemanticssyntaxstructured programmingeffective computability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Abstract data types; algebraic specification (68Q65) Classical propositional logic (03B05) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01) Other classical set theory (including functions, relations, and set algebra) (03E20) Algorithms in computer science (68W99) Theory of computing (68Qxx)

Related Items

Cellular automata in \(1+1\), \(2+1\) and \(3+1\) dimensions, constants of motion and coherent structures, Progress, gaps and obstacles in the classification of cellular automata, Clockwork Rebooted: Is the Universe a Computer?, Unnamed Item, Ensuring termination by typability, Computation theory of cellular automata, Living with a new mathematical species