Oh rrrreeeallly, this is verrry interesting. I would immediately look at this algorithm to see if it can work with neutrosophic isomorphisms as well as automorphisms. Lately I’ve been trying to define consciousness in terms of endomorphisms of systems using systems automorphisms as a channeling mechanism for collective consciousness. So it’d be nice to know if perhaps using neutrosophic isomorphisms or neutrosophic graphs w. crisp isomorphism (possibly with Babai’s algorithm) would reduce computational complexity further while allowing more of a fuzzy generalization of the indeterminacy while time optimizing multiparty communication complexity.
John From: Peter Christiansen [mailto:[email protected]] Sent: Wednesday, November 4, 2015 10:02 PM To: AGI <[email protected]> Subject: [agi] http://www.scottaaronson.com/blog/?p=2521 According to <http://www.math.uchicago.edu/calendar?calendar=Combinatorics%20and%20Theoretical%20Computer%20Science> the University of Chicago’s theory seminar calendar, on Tuesday of next week (November 10), the legendary <https://en.wikipedia.org/wiki/L%C3%A1szl%C3%B3_Babai> Laszlo Babai will be giving a talk about a new algorithm that solves the <https://en.wikipedia.org/wiki/Graph_isomorphism_problem> graph isomorphism problem in quasipolynomial time. Sent from my iPad AGI | <https://www.listbox.com/member/archive/303/=now> Archives <https://www.listbox.com/member/archive/rss/303/248029-82d9122f> | <https://www.listbox.com/member/?&;> Modify Your Subscription <http://www.listbox.com> ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
