- CMU Artificial Intelligence Repository - Mark Kantrowitz
This searchable CMU Artificial Intelligence Repository was established by Mark Kantrowitz in 1993 to collect files, programs and publications of interest to Artificial Intelligence researchers, educators, students, and practitioners. FAQs, news archives,
...more>>
- Common Lisp the Language, 2nd Edition - Tom Bylander
Links for most Common Lisp functions (and other entities) to the portion of the online Common Lisp manual where they are defined. Since the index was automatically generated from the online manual, some functions may not be included in this index. Also,
...more>>
- A compendium of NP optimization problems - Crescenzi & Kann
A continuously updated catalog of approximability results for NP optimization problems. Because no NP-complete problem can be solved in polynomial time (unless P=NP), many approximability results (both positive and negative) of NP-hard optimization problems
...more>>
- Computing Fibonacci Numbers on a Turing Machine - Alex Vinokur
An algorithm that computes Fibonacci numbers on a Turing Machine. Transition table contains 100 rules. The program computes a Fibonacci number. A number 'n' is represented by n 1-s. Input: number 'n'. Output: Fibonacci#n.
...more>>
- Computing Huffman Codes on a Turing Machine - Alex Vinokur
An algorithm that computes Huffman codes on a three-tape Turing Machine. Transition table contains 243 rules. Input: Tape#0 - weights, Tape#1 - empty, Tape#2 - empty. Output: Tape#0 - weights and its Huffman codes, Tape#1 - empty, Tape#2 - empty.
...more>>
- CPLEX Optimization, Inc. - ILOG, Inc.
A provider of large-scale mathematical programming software and services for linear, mixed integer, and quadratic programming. Products: a linear optimizer base system, a callable library option, a mixed-integer solver option, a barrier/QP solver, AMPL
...more>>
- C++ Simulator of a Post Machine - Alex Vinokur
The program simulates Deterministic and Nondeterministic Multitape Post Machine. The following demo Post machines are demonstrated with using the C++ Simulator: an addition of one to a number (Deterministic, 1 tape), an addition of two numbers (Deterministic,
...more>>
- C++ Simulator of a Universal Turing Machine - Alex Vinokur
The program simulates a Universal Turing Machine (UTM). The UTM used in
the Simulator is three-tape Turing Machine: Tape#0 contains transition
table and initial instantaneous description of a Particular Turing Machine
(TM); Tape#1 and Tape#2 are
...more>>
- Exploring the Space of Cellular Automata - Langton, Hayden, Gutowitz, Carr, Fraser
Cellular automata (CA) are discrete space/time logical universes, obeying their own local physics according to given rules. Space in CA is partitioned into discrete volume elements called "cells" and time progresses in discrete steps. Each cell of space
...more>>
- Information Mechanics Group - Massachusetts Institute of Technology
A research group for the physics of computation. Resources for CAM-8, a computer and operating system designed for work with cellular automata, and various papers, which are available for download in PostScript format .
...more>>
- Laurent Habsieger
A research associate at Laboratoire Algorithmique Arithmétique Expérimentale, Laurent Habsieger studies analytic number theory, coding theory, and combinatorics. Some articles on these topics are available for download in PostScript format.
...more>>
- The Mad Genius Research Lab - M. Najtiv
Articles on various aspects of mathematics, computer science, and artificial intelligence that the author believes will be important to future scientific and technological developments, plus brief biographies of a few leading mathematicians and directions
...more>>
- Patterns, Programs, and Links for Conway's Game of Life - Paul Callahan
Descriptions of files available for ftp, links to Life resources available elsewhere on the Internet, new results and patterns not archived elsewhere, and a browsable hypertext catalog of Alan Hensel's archive of Life patterns, including a hypertext version
...more>>
- The Superset Algorithm - M. Najtiv
Resources for the "limited halting problem": finding machines that solve the halting problem for limited classes of inputs without reporting erroneous results. The Collatz problem is a special case. Software (Perl), papers and graphics (PostScript).
...more>>
- Yuri Matiyasevich
Yuri Matiyasevich is best known for finding a negative solution to Hilbert's Tenth Problem, which has applications to the theory of algorithms, algebra, number theory, model theory, proof theory, and theoretical computer science. As well as information
...more>>
| |
|
The Math Forum is a research and educational enterprise of the Drexel School of Education.