scientific article; zbMATH DE number 3400850
From MaRDI portal
Publication:5668779
zbMath0254.02002MaRDI QIDQ5668779
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) General logic (03Bxx) Computability and recursion theory (03Dxx)
Related Items (13)
Analog computation via neural networks ⋮ Computability of homotopy groups of nilpotent complexes ⋮ Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic ⋮ DNA computing: Arrival of biological mathematics ⋮ Grushko-Like Theorems for a Class of Finitely Presented Semigroups ⋮ Thue congruences and the Church-Rosser property ⋮ On uniform learnability of language families ⋮ The undecidability of pattern matching in calculi where primitive recursive functions are representable ⋮ Calcul de longueurs de chaînes de réécriture dans le monoïde libre ⋮ Computing with graph rewriting systems with priorities ⋮ Programming in three-valued logic ⋮ A quantitative Occam's razor ⋮ A view of computability on term algebras
This page was built for publication:
