Medijski sadržaj
- Tweetovi
- Tweetovi i odgovori
- Medijski sadržaj, trenutna stranica.
-
-
In time for the holidays, an illustration of Rémy's algorithm for generating unbiased random binary trees.pic.twitter.com/KpB0raTFus
Prikaži ovu nit -
I think that Andrew Appel (son of Kenneth Appel) would be the one to ask. He recently gave a talk about the proof (and clarified his own contribution!) at the Four Color Fest: https://math.illinois.edu/four-color-fest pic.twitter.com/VCe5k1mNy9
-
anyone familiar with pre-LaTeX Russian mathematics know whether μ was used as a symbol to denote *non*-membership in a set? So the "i μ σ" in this sentence would mean "i ∉ σ"?pic.twitter.com/lNGB3wiDiS
-
enjoyed giving a new version of an old talk for the proof theorists at QMUL. Not sure whether this slide was appropriate, though.pic.twitter.com/BNIYgL2gXn
-
Finally, I definitely recommend spending a lazy afternoon strolling around the gallery! Here we've used it to display all linear λ-terms of size 8 with no beta-redices and with 2 crossings in their diagram. https://www.georgejkaye.com/fyp/gallery.html …pic.twitter.com/skP1AM3Fd2
Prikaži ovu nit -
You can also use it to generate normalisation graphs (really these are graphs of graphs!). For example, this particularly beautiful normalisation graph is generated by a linear term representing the formula "T ∧ F" (based on an encoding of boolean circuits due to Harry Mairson).pic.twitter.com/hmn0e4gjG8
Prikaži ovu nit -
The visualiser lets you inspect λ-terms as certain kinds of graphs, while also keeping track of various interesting statistics. https://www.georgejkaye.com/fyp/visualiser.html …pic.twitter.com/xEhRTctR8M
Prikaži ovu nit -
Have I mentioned CLA? It is a fun annual workshop on interactions between logic and combinatorics, where you might see slides like the one attached. CLA 2019 is 1-2 July in Versailles... still time to submit a talk proposal, and registration is free! http://cla.tcs.uj.edu.pl/ pic.twitter.com/CvGfRw0URg
-
-
He actually gave us advance warning about this in his landmark paper "On the translation of languages from left to right" (1965), see quoted passage :-)pic.twitter.com/AjaDo5q6D4
-
"Clearly it would be an extremely interesting project from the standpoint of high-level programming language design to find an elegant notation in which Bishop's constructions are both readable and explicit". [Writing just a few years before Coq!]pic.twitter.com/EBXYs92cCC
Prikaži ovu nit -
His approach: take nine random math books from his library and see what they have on page 100! (Foreshadowing 3:16 https://www-cs-faculty.stanford.edu/~knuth/316.html ?)pic.twitter.com/M8yJuzkKyl
Prikaži ovu nit -
The department library is getting rid of books, so I scavenged some old LNCS proceedings for a 1979 symposium on "Algorithms in Modern Mathematics and Computer Science" organized by Ershov & Knuth, held in Urgench, Uzbek SSR with an interesting premise.pic.twitter.com/2bCQ2gjnMC
Prikaži ovu nit -
Here's a bit more context from a short biographical memoir by Saunders Mac Lane (http://www.nasonline.org/publications/biographical-memoirs/memoir-pdfs/kleene-stephen.pdf …):pic.twitter.com/XQfowQdnEs
Prikaži ovu nit -
Interesting article. I did not know that McCulloch and Pitts were so strongly influenced by logic, but indeed, here's the bibliography from their original paper.pic.twitter.com/hX06yLcP9e
-
check out that bibliography (history's most ambitious crossover event?)pic.twitter.com/dqLwnwOffP
Prikaži ovu nit -
Did you know that Kleene introduced regular expressions and finite automata in a 1951 RAND research memorandum on neural nets?pic.twitter.com/cBtXcGFzG0
Prikaži ovu nit -
From Lambek (1961), "How to Program an Infinite Abacus" https://doi.org/10.4153/CMB-1961-032-6 …pic.twitter.com/XJXIky4TUV
-
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.