Chelsea Nguyen (math major and Honors student) has been pursuing undergraduate research under the guidance of Daisuke Takagi.
Last week she presented a poster at the Ocean Science Meeting, the flagship conference for ocean science that brings together a diverse group of scientists, engineers and mathematicians working on anything ocean related. Above we see her presenting the poster.
Automatic Complexity: A computable measure of irregularity
was published by De Gruyter.
The books challenge computability theory in different yet similar ways:
Programs as diagrams argues that Turing machines can be replaced by category-theoretical diagrams for a more natural understanding of computability.
Automatic complexity advocates replacing Turing machines by finite automata in the definition of Kolmogorov complexity, thus obtaining a computable notion that is “visual” in an analogous way to Pavlovic’s diagrams.
Assistant Professor Daniel Erman will be giving a prestigious AMS Invited Address at the Joint Mathematics Meetings in San Francisco in January 2024. There will also be an AMS Special Session on Commutative Algebra and Algebraic Geometry (associated with Invited Address by Daniel Erman).
Thursday January 4, 2024, 2:15 p.m.-3:20 p.m.
AMS Invited Address
Organizers:
Michelle Ann Manes, American Institute of Mathematics
Introduction by:
David Eisenbud, MSRI
From Hilbert to Mirror Symmetry
Room 207, The Moscone Center
Daniel Erman*, University of Hawaii