Group items tagged

SubScript, a way to extend common programming languages aimed to ease event handling and concurrency. Typical application areas are GUI controllers, text processing applications and discrete event simulations. SubScript is based on a mathematical concurrency theory named Algebra of Communicating Processes (ACP). ACP is a 30-year-old branch of mathematics, as solid as numeric algebra and as Boolean algebra. In fact, you can regard ACP as an extension to Boolean algebra with 'things that can happen'. These items are glued together with operations such alternative, sequential and parallel compositions. This way ACP combines the essence of grammar specification languages and notions of parallelism.

"Bandicoot is an open source programming system with a new set-based programming language, persistency capabilities, and run-time environment. The language is similar to general purpose programming languages where you write functions/methods and access data through variables. Though, in Bandicoot, you always manipulate data in sets using a small set-based algebra (the relational algebra)." "Here are the main features:   - functions are automatically exposed via HTTP using CSV for data, e.g. /List, /Append  - supports persistency via global variables (with transactions and ACID)  - can run on multiple computers to scale up the read throughput  - built in operators from the relational algebra with a simple syntax, e.g. "+" (union), "-" (minus)  - small binary ~100KB"

"Abstract algebra for Scala. This code is targeted at building aggregation systems (via Scalding or Storm). It was originally developed as part of Scalding's Matrix API, where Matrices had values which are elements of Monoids, Groups, or Rings. Subsequently, it was clear that the code had broader application within Scalding and on other projects within Twitter."

Breeze is a numerical processing library for Scala.

"Australian engineers just built a quantum logic gate in silicon for the first time"

El algebra boole / ley de morgan de la "puertas lógicas" tiene 2 estados ( 0 y 1 , con la con 2 NANDS tengo todo ) y la tautologia de las tablas se basa en esos 2 estados. Si pensamos en QBit ( |0> , |1> , |01>, |10>, .....) ), no hay tautologia clasica... se derrumba el álgebra de boole/morgan en este campo, salvo que sean reversibles las operaciones. Interesante el campo que se abre !!!!!! a investigar un poco mas del tema en lo que se refiera a superposición cuántica.