Skip to main navigation Skip to search Skip to main content

On functional entropy

  • University of Massachusetts Boston

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This Note defines a numerical characteristic of functions between finite sets that satisfies certain properties related to common operations applied to functions. Unlike the notion of entropy of a probability distribution, the entropy of a function has an algebraic rather than a probabilistic character, though the two notions are clearly related. We point to applications of this notion to the study of finite functions.

Original languageEnglish
Title of host publicationProceedings of The International Symposium on Multiple-Valued Logic
PublisherPubl by IEEE
Pages100-104
Number of pages5
ISBN (Print)0818633506
StatePublished - 1993
EventProceedings of the 23rd International Symposium on Multiple-Valued Logic - Sacramento, CA, USA
Duration: May 24 1993 → May 27 1993

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
ISSN (Print)0195-623X

Conference

ConferenceProceedings of the 23rd International Symposium on Multiple-Valued Logic
CitySacramento, CA, USA
Period5/24/93 → 5/27/93

ASJC Scopus Subject Areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'On functional entropy'. Together they form a unique fingerprint.

Cite this