dmm: (Default)
Dataflow matrix machines (by Anhinga anhinga) ([personal profile] dmm) wrote2023-06-03 08:54 am
Entry tags:

Conferences

The details will be in comments (I have mixed feeling about all this).

I am seeing people talking about their talks being accepted for Strange Loop. It seems that this will be the last Strange Loop conference (I have no idea why).

Terence Tao is co-organizing "AI to Assist Mathematical Reasoning" online workshop (June 12-14).

Joint conference of "Algebra and Coalgebra in Computer Science" and "Mathematical Foundations of Programming Semantics" is on June 19-23 (free for those who participate online).
juan_gandhi: (Default)

[personal profile] juan_gandhi 2023-06-03 01:35 pm (UTC)(link)

I enjoyed StrangeLoop once or twice, but that was enough.

As to "Algebra and Coalgebra", I'd be curious a little bit, although it's been all pretty much known for a while.

chaource: (Default)

[personal profile] chaource 2023-06-03 06:19 pm (UTC)(link)
At some point I had an impression that AI could help in automatic theorem proving. For example, the first-order logic is not decidable but an AI could learn to prove or disprove its theorems much as it learned how to play chess and go. There is a "game semantics" in theorem proving where the "game moves" consist of possible specific choice of the next axiom or derivation rule of the logic, and the "response" is the next set of sequents or terms to be proved. Is that what they are trying to do now?
chaource: (Default)

[personal profile] chaource 2023-06-04 09:30 am (UTC)(link)
This is great. At some point, those developments could be used to make an intelligent compiler that can (at least sometimes) perform undecidable tasks. For example, type checking in many lambda calculi is undecidable; generating code from type in a dependently-typed language is undecidable; etc.