BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Iowa Colloquium on Information, Complexity, and Logic (ICICL) - ECPv5.4.0.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Iowa Colloquium on Information, Complexity, and Logic (ICICL)
X-ORIGINAL-URL:https://icicl.cs.iastate.edu
X-WR-CALDESC:Events for Iowa Colloquium on Information, Complexity, and Logic (ICICL)
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20191107T154000
DTEND;TZID=UTC:20191107T170000
DTSTAMP:20260501T091852
CREATED:20191122T041753Z
LAST-MODIFIED:20191122T050322Z
UID:409-1573141200-1573146000@icicl.cs.iastate.edu
SUMMARY:New developments on algorithmically random closed sets
DESCRIPTION:Speaker: Christopher Porter (Drake University) \nAbstract: In this talk\, I will discuss recent joint work with Adam Case on algorithmically random closed subsets of Cantor space. In earlier work\, Cenzer and Weber studied the behavior of various biased random closed sets under unions and intersections\, showing that these operations preserve randomness in the sense that performing such an operation on a pair of relatively random closed sets results in a closed set that is random with respect to the measure induced by the operation. We obtain partial converses of these results\, answering the following question: Given a closed set that is random with respect to a certain biased measure\, when can it be obtained as the union or intersection of a pair of relatively random closed sets (that are random with respect to an appropriately chosen measure)? In addition\, I will discuss some results on multiple intersections of random closed sets that have emerged from this work.
URL:https://icicl.cs.iastate.edu/event/new-developments-on-algorithmically-random-closed-sets/
LOCATION:Drake University\, 2507 University Avenue\, Des Moines\, IA\, 50311\, United States
CATEGORIES:Talk
END:VEVENT
END:VCALENDAR