Norman M. Birkett

@normed_space

Analytic philosopher writing formalisms that execute, mostly in finance. C++. Paradigms? Digs 'em. Puns! Brainstorms here too much. Too long-winded to use Twitt

New York City and northern NJ
Vrijeme pridruživanja: rujan 2019.

Tweetovi

Blokirali ste korisnika/cu @normed_space

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @normed_space

  1. Prikvačeni tweet
    2. stu 2019.
    Prikaži ovu nit
    Poništi
  2. 31. sij

    I want to find a functional programming purist named Surendra so I can call him Unconditional Surendra. (I guess I'm due for a weekend.)

    Poništi
  3. 31. sij

    I once set out to learn parliamentary procedure, but it seemed that I was just going through the motions.

    Poništi
  4. 30. sij

    That does sound like a case of the cure being worse than the disease.

    Poništi
  5. 30. sij

    It has occurred to me that they may have put it this way to subliminally influence people to get ice in their cup before getting water--the less splashy order. I'm especially pleased to announce that for once in my life I did not figure this out the hard way.

    Poništi
  6. 30. sij

    Well, I guess he's a shoe-in to get gigs playing bars.

    Poništi
  7. 29. sij

    I've wondered if C++ needs to go to multiple levels of deprecation: very d., most d., that than which no more d. can be conceived, etc., or maybe depcon 1, depcon 2...

    Poništi
  8. 28. sij

    Look on the bright side. Their software designers weren't involved. Could have been much worse.

    Poništi
  9. 27. sij

    Excited about forthcoming second edition of 's Intro to Formal Logic. From the few chapters I've seen, it will be enormously useful to a wide range of students who want to get from little or no logic to mastery of the basics. My new go-to recommendation.

    Poništi
  10. 27. sij

    I'm not sure it's a matter of syntax per se, but of the semantics of negation in the language in question. English follows truth-functional semantics for double negation. I gather there are other languages in which double negation is emphatic negation. That fascinates me!

    Poništi
  11. 27. sij

    The problem is that 'irregardless' is normally used to mean 'regardless'. If it meant 'regardful', then you would be right. But it doesn't.

    Poništi
  12. 24. sij

    Delighted to find someone else who consts by-value fn params, ESPECIALLY since that someone is , whose opinions I greatly respect. A very useful talk for us who work in legacy code. CppCon 2019: Jason Turner “C++ Code Smells” via

    Poništi
  13. 21. sij

    I suppose the preceding ramble amounts to some hypotheses of mine about why it might be true. But I would love to know if anyone else has noticed anything like this, or has any better theories. 12/12

    Prikaži ovu nit
    Poništi
  14. 21. sij

    And I'm very sure from my experience that lots of bright CS graduates don't have a clue about how to express the kinds of "row-set-level semantics" I'm talking about. Which makes me curious why that is. 11/n

    Prikaži ovu nit
    Poništi
  15. 21. sij

    I'm pretty sure from my reading that apart from (maybe) the odd database specialist, work on algorithms doesn't widely target quantification problems--and the very hard work of carving out subproblems that are tractable. 10/n

    Prikaži ovu nit
    Poništi
  16. 21. sij

    I don't know how logic is taught to computer scientists; perhaps quantification is a bit neglected, because it's hard and frequently not computable. I'm curious about that. 9/n

    Prikaži ovu nit
    Poništi
  17. 21. sij

    #2 Automated eval'n of quantified expressions is often computationally intractable--or, put otherwise, if not done carefully can easily land you in O(n^2) or worse complexity. 8/n

    Prikaži ovu nit
    Poništi
  18. 21. sij

    Meanwhile, back at the logic and CS ranches, I note two facts--at least, I think they are facts: #1 Learning to use quantification is hard, usually a big step up for students learning predicate calculus. 7/n

    Prikaži ovu nit
    Poništi
  19. 21. sij

    The kind of semantic rules I have in mind as problems would nearly always require quantification (over the set of rows of data) if one were to try to state them in a predicate logic system, and the ones that we don't have as much trouble with usually wouldn't. 6/n

    Prikaži ovu nit
    Poništi
  20. 21. sij

    In my experience--many years working with data-rich interfaces, chiefly of the callable variety--most of our bugs have to do with this kind of failing. 5/n

    Prikaži ovu nit
    Poništi
  21. 21. sij

    Whereas the ones we tend to fail to notice, enforce, check, and so forth, are the ones that concern relations between different rows of data, or worse yet, that concern things like cardinalities of various subsets of the set of rows. 4/n

    Prikaži ovu nit
    Poništi

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

    ·