Skip to content

Lambda Calculus & A Place to Bury Strangers links for 2008-11-19

View from Cathedral Tower, Sevilla, Spain

  • 5.A Place to Bury Strangers – A Place to Bury Strangers: The New York City band’s debut album is one of the loudest you’ll hear, with its wall of guitars, like a Jesus and Mary Chain record turned up to 11. It’s a relentless sonic assault that also borrows from the best that many shoegaze bands had to offer. The swirling guitars help showcase the melodies, which are then beaten into submission by the sheer volume of it all on tracks like “Don’t Think Lover.” This one should be played extremely loud.
    (tags: aptbs review)
  • A Place To Bury Strangers recently announced an intimate show at Mercury Lounge that night, while across the water in New Jersey, Yo La Tengo will headline the new venue Wellmont Theatre.
    (tags: aptbs)
  • In mathematical logic and computer science, lambda calculus, also written as λ-calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole Kleene in the 1930s as part of an investigation into the foundations of mathematics, but has emerged as a useful tool in the investigation of problems in computability or recursion theory, and forms the basis of a paradigm of computer programming called functional programming.
  • Lambda calculus is a notation for describing mathematical functions and programs. It is a mathematical system for studying the interaction of functional abstraction and functional application. It captures some of the essential, common features of a wide variety of programming languages. Because it directly supports abstraction, it is a more natural model of universal computation than a Turing machine is.
  • Most people have heard of the Turing machine, as it’s now tantamount to being the measuring stick by which computability is judged. If something is computable on a Turing machine, it is considered computable; if something isn’t computable on a Turing machine it’s considered uncomputable. There is however, another model, equally as powerful, that is quite different. It has no concept of Turing machine style “state”, and it has some very nice algebraic-like properties. It’s called the l-calculus. 
    (tags: lambda logic y-combinator calculus functional Programming)
  • I caught them again recently at the 930 Club here in DC and it was the same thing. Their stage presence is amazing. Like catch-your-breath, oh-my-god-are-you-watching-this amazing.
    (tags: aptbs)

Post a Comment

Your email is never published nor shared. Required fields are marked *