On a categorical approach to the study of algorithmic algebras

DOI10.1007/BF01132780zbMATH Open0824.08006OpenAlexW2329558022MaRDI QIDQ1895010FDOQ1895010

Authors: S. V. Surzhko 

Publication date: 6 August 1995

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01132780

Recommendations

• Data based algorithmic algebra
• Towards a definition of an algorithm
• Issues of algorithmics and Glushkov's systems of algorithmic algebras
• scientific article; zbMATH DE number 517047
• On algebras of algorithms and specifications over uninterpreted data

zbMATH Keywords

data separationStone spacealgorithmic algebrasinterpretersCantor perfect spacedata space

Mathematics Subject Classification ID

Other algebras related to logic (03G25) Categories of algebras (08C05) Applications of universal algebra in computer science (08A70) Theory of computing (68Q99)

Cites Work

• Title not available (Why is that?)

Cited In (8)

• Algorithms for categorical equivalence
• Two Lax categorifications of Kalman algebras and the category of minimization heuristics
• Towards a definition of an algorithm
• Complete interpretations of \(\Omega\)-languages and free algebras of \(\Omega\)-elements
• Title not available (Why is that?)
• Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
• The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy
• Computable categoricity for algebraic fields with splitting algorithms

This page was built for publication: On a categorical approach to the study of algorithmic algebras

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