Browse and Search the Library
Home : Math Topics : Applications/Connections : Sciences : Computer Science : Formal Lang./Automata

All Sites - 11 items found, showing 1 to 11
 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>> 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>> IBM ILOG CPLEX - International Business Machines Corp. This mathematical optimization software features dynamic algorithm parameter control and post-solution information and analysis such as objective function value, solution variable and slack values, constraint dual values (shadow prices), bound sensitivity ...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>> 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>>
Page:  1

Search for these keywords:

#### Click only once for faster results:

all keywords, in any order at least one, that exact phrase
parts of words whole words

Power Search

Home || The Math Library || Quick Reference || Search || Help