GNU TeXmacs is a free wysiwyw (what you see is what you want) editing platform with special features for scientists. The software aims to provide a unified and user friendly framework for editing structured documents with different types of content: text, mathematics, graphics, interactive content. TeXmacs can also be used as an interface to many external systems for computer algebra, numerical analysis, and statistics. New presentation styles can be written by the user and new features can be added to the editor using Scheme.
Maximum entropy is a powerful method for constructing statistical models of classification tasks, such as part-of-speech tagging in Natural Language Processing. The Quipu Maximum Entropy Package is a Java implementation of the maximum entropy framework. It allows you to train, evaluate, and use maxent models.
The Freehand Formula Entry System is a research prototype for recognizing online handwritten mathematical notation, developed jointly by researchers in New Zealand, the United States and Canada. A user draws expressions with a mouse or data tablet, and LaTeX, a bitmap, and an operator tree are produced as output. Symbol recognition and expression interpretation are performed as the user draws.
num-utils are a set of programs for dealing with numbers from the Unix command line. Much like the other command line utilities grep, awk, sort, cut, etc. these utilities work on numeric data from both standard in and data from files. The base utilities currently included are average, bound, interval, numgrep, numprocess, numsum, random, range, and round. If you work with pipelines on the command line, these tools will prove to be helpful.
Lindenmayer Systems in Python provides a simple implementation of Lindenmayer systems (also called "L-systems" or "substitution systems"). In basic form, a Lindenmayer system consists of a starting string of symbols from an alphabet which has repeated transitions applied to it, specified by a list of transition search-and-replace rules. In addition to the standard formulation, two alternative implementations are included: sequential systems (in which at most one rule is applied) and tag systems (in which the transition only takes place at the beginning and end of the string). Despite being implemented entirely in Python, for reasonable rules on a modern machine, the system is capable of running thousands of generations per second. Lindenmayer systems are found in artificial intelligence and artificial life and can be used to generate fractal patterns (usually via mapping symbols from the alphabet to turtle commands), organic-looking patterns that can simulate plants or other living things, or even music.
The goal of Hilbert II, which is in the tradition of Hilbert's program, is the creation of a system that enables a working mathematician to put theorems and proofs (in the formal language of predicate calculus) into it. These proofs are automatically verified by a proof checker. Because this system is not centrally administered and enables references to any location on the Internet, a world wide mathematical knowledge base could be built. It also contains information in "common mathematical language".