Randnomness, computability, and algebraic specifications

DOI10.1016/S0168-0072(97)00040-7zbMath0915.03037OpenAlexW1968784437MaRDI QIDQ1382180

Bakhadyr Khoussainov

Publication date: 27 June 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(97)00040-7

zbMATH Keywords

Kolmogorov complexityrandomnessfinitely generated algebrasabstract data types

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Abstract data types; algebraic specification (68Q65) Applications of computability and recursion theory (03D80) Equational classes, universal algebra in model theory (03C05) Theory of numerations, effectively presented structures (03D45)

Related Items (6)

On algebraic and logical specifications of classes of regular languages. ⋮ A Quest for Algorithmically Random Infinite Structures, II ⋮ Finitely presented expansions of computably enumerable semigroups ⋮ Degrees of Word Problem for Algebras Without Finitely Presented Expansions ⋮ Finitely presented expansions of groups, semigroups, and algebras ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems

Cites Work

• Crypt-equivalent algebraic specifications
• Algebraic specifications of computable and semicomputable data types
• The completeness of the algebraic specification methods for computable data types
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Computable Algebra, General Theory and Theory of Computable Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Randnomness, computability, and algebraic specifications