CUNY Graduate Center RSS Feedshttp://www.gc.cuny.eduCopyright 2015 CUNY Graduate Center. All rights reserved.Rohit Parikh, Brooklyn Coolege Title: The logic and strategy of political campaigning<p>Event Date: 9/24/2015 4:15:32 PM</p><p>
Rohit Parikh, Brooklyn Coolege<br />
Title: The logic and strategy of political campaigning</p>
http://www.gc.cuny.edu/News/Calendar/Detail?id=326212_309/24/20154:15 PM09/24/20156:00 PM365 Fifth AvenueThe Graduate Center9204FreeRohit Parikh, Brooklyn Coolege
Title: The logic and strategy of political campaigning32374Noson Yanofsky: Kolmogorov Complexity of Categorical Structures<p>Event Date: 9/17/2015 4:15:48 PM</p>Speaker: Noson Yanofsky, Brooklyn College<br />
<br />
Title: Kolmogorov Complexity of Categorical Structures<br />
<br />
Abstract: Kolmogorov complexity (KC) is a measure of the informational content of a string. For a given string, the KC is the size of the shortest program that can produce the string. If the KC is small, then the string can be compressed and does not have much information. If the KC is large then the string cannot be compressed and it contains a lot of information. We are interested in the KC of general mathematical structures. Most mathematical structure can be described by constructions in category theory. We formulate a programing language to describe categorical constructions. We then define the KC of a mathematical structure to be the length of the shortest such program that can produce that structure. We show basic properties of this KC and explore its relationship with classical KC. We also discuss what can and cannot be constructed by category theory. The talk will begin with a short introduction to classical KC and to the basics of category theory.http://www.gc.cuny.edu/News/Calendar/Detail?id=326202_309/17/20154:15 PM09/17/20156:00 PM365 Fifth AvenueThe Graduate Center9204FreeSpeaker: Noson Yanofsky, Brooklyn College
Title: Kolmogorov Complexity of Categorical Structures32373