COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Language compression for sets in P/poly

## Language compression for sets in P/polyAdd to your list(s) Download to your calendar using vCal - Zimand, M (Towson University)
- Wednesday 04 July 2012, 10:00-10:30
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Semantics and Syntax: A Legacy of Alan Turing If we consider a finite set $A$, it is desirable to represent every
$x$ in $A$ by another shorter string compressed($x$) such that
compressed($x$) describes unambiguously the initial $x$. Regarding
the compression rate, ideally, one would like to achieve the
information-theoretical bound |compressed($x$)| $pprox log (|A|)$,
for all $x$ in $A$. This optimal rate is achievable for c.e. (and also
co-c.e.) sets $A$, because for such a set C($x$) $leq log (|A This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsCambridge Energy Conference CEDiR Required lists for MLG## Other talksCambridge-Lausanne Workshop 2018 - Day 1 Prof Murray Shanahan: Artificial Intelligence The DNA oxygenase TET1 in mammalian embryonic development and epigenetic reprogramming Plants of the Richtersveld Intravital Imaging – Applications and Image Analysis/ Information session on Borysiewicz Biomedical Sciences Fellowships Elizabeth Bowen's Writings of the Second World War Mathematical applications of little string theory The Partition of India and Migration Crowding and the disruptive effect of clutter throughout the visual system A polyfold lab report New micro-machines, new materials |