Galois Theory of Algorithms

DOI10.1007/978-3-319-47843-2_17zbMath1439.68008arXiv1011.0014OpenAlexW1888737434MaRDI QIDQ3299851

Noson S. Yanofsky

Publication date: 27 July 2020

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.0014

zbMATH Keywords

algorithmsmonoidal categoriesGalois theorycomputable functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) General topics in the theory of algorithms (68W01) Monoidal categories, symmetric monoidal categories (18M05)

Related Items (1)

From Dyson-Schwinger equations to quantum entanglement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pre-recursive categories
• Cartesian categories with natural numbers object
• Definability and invariance
• Towards a Definition of an Algorithm
• Lectures on N-Categories and Cohomology
• When are Two Algorithms the Same?

This page was built for publication: Galois Theory of Algorithms