The Geometry of Computation-Graph Abstraction

DOI10.1145/3209108.3209127MaRDI QIDQ5145351zbMATH OpenOpenAlexFDO

Authors Koko Muroya, Steven Cheung, Dan R. Ghica

Publication date 20 January 2021

Published in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL http://pure-oai.bham.ac.uk/ws/files/50171606/The_Geometry.pdf

zbMATH Keywords

geometry of interactionsemantics of programming languagestensorflow

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 3995937
• Abstract Geometrical Computation and Computable Analysis
• Graph-Theoretic Solutions to Computational Geometry Problems
• New Computational Paradigms
• Abstract geometrical computation. V: Embedding computable analysis
• The geometry of graphs and some of its algorithmic applications
• Geometry of abstraction in quantum computation
• Towards a Theory of Geometric Graphs
• New Computational Paradigms
• The interface between computational and combinatorial geometry

Cited in

(6)

• Diagrammatic algebra of first order logic
• A robust graph-based approach to observational equivalence
• When Lawvere meets Peirce: an equational presentation of Boolean hyperdoctrines
• Tape diagrams for monoidal monads
• The calculus of neo-Peircean relations
• On Boolean hyperdoctrines and peircean bicategories

This page was built for publication: The Geometry of Computation-Graph Abstraction

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