Noam Zeilberger

@noamzoam

All that springs from the ⅄

Vrijeme pridruživanja: prosinac 2012.

Medijski sadržaj

  1. 17. pro 2019.

    bonus Hanukkah version:

    Prikaži ovu nit
  2. 17. pro 2019.

    In time for the holidays, an illustration of Rémy's algorithm for generating unbiased random binary trees.

    Prikaži ovu nit
  3. 28. lis 2019.
    Odgovor korisniku/ci

    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:

  4. 17. ruj 2019.

    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 ∉ σ"?

  5. 18. lip 2019.

    enjoyed giving a new version of an old talk for the proof theorists at QMUL. Not sure whether this slide was appropriate, though.

  6. 7. lip 2019.

    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.

    Prikaži ovu nit
  7. 7. lip 2019.

    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).

    Prikaži ovu nit
  8. 7. lip 2019.

    The visualiser lets you inspect λ-terms as certain kinds of graphs, while also keeping track of various interesting statistics.

    Prikaži ovu nit
  9. 25. svi 2019.

    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!

  10. 27. tra 2019.
    Odgovor korisniku/ci
  11. 18. tra 2019.
    Odgovor korisniku/ci

    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 :-)

  12. 20. velj 2019.

    "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!]

    Prikaži ovu nit
  13. 20. velj 2019.

    His approach: take nine random math books from his library and see what they have on page 100! (Foreshadowing 3:16 ?)

    Prikaži ovu nit
  14. 20. velj 2019.

    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.

    Prikaži ovu nit
  15. 17. velj 2019.

    Here's a bit more context from a short biographical memoir by Saunders Mac Lane ():

    Prikaži ovu nit
  16. 17. velj 2019.
    Odgovor korisniku/ci

    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.

  17. 16. velj 2019.

    check out that bibliography (history's most ambitious crossover event?)

    Prikaži ovu nit
  18. 16. velj 2019.

    Did you know that Kleene introduced regular expressions and finite automata in a 1951 RAND research memorandum on neural nets?

    Prikaži ovu nit
  19. 15. velj 2019.

    From Lambek (1961), "How to Program an Infinite Abacus"

  20. 25. sij 2019.

    and one more from Isabella Larcher's talk

    Prikaži ovu nit

Č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.

    Možda bi vam se svidjelo i ovo:

    ·