STOP SOPA ☣ STOP RWA
Two bills are making their way through the U.S. Congress that would have highly negative consequences for AcaWiki and the public good. Please take action against both.
Many large sites are blacked out January 18 to spur action against SOPA. Visit americancensorship.org to take action against this bill, which is a censorship and security risk for the entire internet. Wikimedia's General Counsel explains how SOPA would hurt wikis.
RWA would prohibit federal agencies from conditioning their grants to require that articles reporting on publicly funded research be made accessible to the public online. This is unjust and would specifically harm AcaWiki by greatly reducing the number of people with access to important literature — access is required to summarize. Please tell congresspeople to oppose RWA.
See AcaWiki:SOPA-RWA for planning and discussion of this message.
Recounting the Rationals: Twice!
From AcaWiki
Citation: Roland Backhouse, Joao F. Ferreira (2008) Recounting the Rationals: Twice!. Mathematics of Program Construction, LNCS 5133 (RSS)
Download: http://www.joaoff.com/publications/2008/rationals
Tagged: Computer Science (RSS) algorithm enumeration rationals stern-brocot program construction mathematics (RSS)
Summary:
This paper shows the derivation of an algorithm that enables the positive rationals to be enumerated in two different ways. One way is known, and is called Calkin-Wilf-Newman enumeration; the second is new and corresponds to a flattening of the Stern-Brocot tree of rationals. We show that both enumerations stem from the same simple algorithm. In this way, we construct a Stern-Brocot enumeration algorithm with the same time and space complexity as Calkin-Wilf-Newman enumeration.
