BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Liling Ko (Ohio State University)
DTSTART:20230209T190000Z
DTEND:20230209T200000Z
DTSTAMP:20260423T040000Z
UID:OLS/118
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/118/">Co
 mputable smallness is not intrinsic smallness</a>\nby Liling Ko (Ohio Stat
 e University) as part of Online logic seminar\n\n\nAbstract\nWe construct 
 a set $A$ that is computably small but not intrinsically small. To underst
 and these terms\, we liken $A$ to a game show host playing against a class
  of computable contestants\, analogous to an infinite variant of the Monty
  Hall problem. The host has infinitely many doors arranged in a line\, and
  each door hides either a goat or a car. A contestant selects infinitely m
 any doors to open and wins if a non-zero density of the selected doors hid
 es a car. Contestants that are disorderly can select doors out of order\, 
 opening door $i$ after door $j>i$. Are disorderly contestants more difficu
 lt to beat than orderly ones? This is known to be true if contestants are 
 allowed to be adaptive\, where they may choose a different door depending 
 on the outcomes of the previously opened ones [1] (via the theorem that MW
 C-stochasticity 0 does not imply Kolmogorov-Loveland-stochasticity 0). We 
 give a constructive proof to show that the statement also holds in the non
 -adaptive setting\, shedding light on a disorderly structure that outperfo
 rms orderly ones. This is joint work with Justin Miller.\n\n[1] Merkle\, W
 olfgang and Miller\, Joseph S and Nies\, Andre and Reimann\, Jan and Steph
 an\, Frank. Kolmogorov--Loveland randomness and stochasticity. Annals of P
 ure and Applied Logic\, vol.138 (2006)\, no.1-3\, pp.183--210.\n
LOCATION:https://researchseminars.org/talk/OLS/118/
END:VEVENT
END:VCALENDAR