Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A mathematical theory of resources
Coecke B., Fritz T., Spekkens R.  Information and Computation 250 59-86, 2016. Type: Article
Date Reviewed: Apr 12 2017

Many of the physical sciences ultimately deal with resources. The important questions are: Can a given resource be converted into another? And if so, how? Examples abound:

  • Chemistry: How can chemicals react to turn into others?
  • Thermodynamics: How can work be extracted from thermal imbalance?
  • Computation: How can gates be combined to form circuits computing a given function?
  • Logic: How can a conclusion be derived from hypotheses?
  • Quantum theory: What can entanglement achieve that couldn’t be achieved without it?
  • Geometry: Which figures can be turned into others using compass and straightedge only?

This paper develops and studies a general framework intended to capture these interconversions. The eventual aim is to identify general concepts and features among them. The framework is given in three stages of increasing simplicity.

In the first stage, resources are modeled as objects in a symmetric monoidal category, whose morphisms model conversion of resources. This is very general; such a model can be constructed from any partitioned process theory.

The second stage deals with resource convertibility only. Here, one is interested only in the possibility of converting one resource into another, instead of how the conversion is implemented. The categorical structure is flattened into a commutative preordered monoid. At this level, one can for example speak of catalysis: resource A alone might not be convertible into B, but A in the presence of C could possibly be turned into B without using up C.

The third stage quantifies the cost of resources and conversions. Some resources are free (those with a morphism from the monoidal unit), whereas some are valuable. This is modeled by a monotone: a function from the monoid to the real numbers. Examples include Shannon entropy. At this level, one can, for example, handle asymptotic rates of conversion, as in currency exchange.

Reviewer:  Chris Heunen Review #: CR145188 (1706-0387)
Bookmark and Share
 
Mathematical Logic And Formal Languages (F.4 )
 
 
Automata (F.1.1 ... )
 
 
Knowledge Representation Formalisms And Methods (I.2.4 )
 
 
Systems And Information Theory (H.1.1 )
 
 
Physical Sciences And Engineering (J.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Mathematical Logic And Formal Languages": Date
Logics for approximate entailment in ordered universes of discourse
Vetterlein T., Esteva F., Godo L.  International Journal of Approximate Reasoning 71(C): 50-63, 2016. Type: Article
Jun 15 2016
Real or natural number interpretation and their effect on complexity
Bonfante G., Deloup F., Henrot A.  Theoretical Computer Science 585(C): 25-40, 2015. Type: Article
Jul 29 2015

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy