turing
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 14
gTuring 0.1.1
gTuring project is a Turing Machine simulator for GNOME. more>>
gTuring project is a Turing Machine simulator for GNOME.
Any empty line or any line beginning with a hash (#) is ignored. In other case, five tokens, each separated by a space, are expected. These are the state number, the expected symbol, the symbol to write, the direction to move, and the new state. Anything following these tokens is ignored.
Expected symbols and symbols to write can be any printable character. The blank character is represented by the underscore (_). States are integer numbers, starting from 0. The possible directions to move are left and right, represented by l and r, respectively.
The machine starts at state 0 and stops when it cannot find the new state or the new state doesnt expect the read symbol.
Enhancements:
- First release after the porting to GNOME2 started.
- New table with machines states with better interface. Yu can edit the states, but not add new ones.
<<lessAny empty line or any line beginning with a hash (#) is ignored. In other case, five tokens, each separated by a space, are expected. These are the state number, the expected symbol, the symbol to write, the direction to move, and the new state. Anything following these tokens is ignored.
Expected symbols and symbols to write can be any printable character. The blank character is represented by the underscore (_). States are integer numbers, starting from 0. The possible directions to move are left and right, represented by l and r, respectively.
The machine starts at state 0 and stops when it cannot find the new state or the new state doesnt expect the read symbol.
Enhancements:
- First release after the porting to GNOME2 started.
- New table with machines states with better interface. Yu can edit the states, but not add new ones.
Download (MB)
Added: 2006-11-21 License: GPL (GNU General Public License) Price:
1070 downloads
Visual Turing Machine 2.0
Visual Turing Machine is a program that lets you create Turing machines with a point and click interface. more>>
Visual Turing Machine project is a program that lets you create Turing machines with a point and click interface instead of using esoteric languages.
You can pack your complex machines into small boxes, and then reuse them as part of a bigger machine. VTM also features an infinite length tape.
Enhancements:
- New features include an n-ary set of symbols, multiple windows (MDI), a huge workspace (10000x10000 pixels) without a memory issue, the ability to edit your own machines, the ability to execute machines n times (where n is undefined), the ability to use expressions (like n+5) to execute machines, the ability to execute machines at desired speeds, statistics to see how many instructions were executed and how much tape was "used", and an easy wasy to translate the program to other languages.
<<lessYou can pack your complex machines into small boxes, and then reuse them as part of a bigger machine. VTM also features an infinite length tape.
Enhancements:
- New features include an n-ary set of symbols, multiple windows (MDI), a huge workspace (10000x10000 pixels) without a memory issue, the ability to edit your own machines, the ability to execute machines n times (where n is undefined), the ability to use expressions (like n+5) to execute machines, the ability to execute machines at desired speeds, statistics to see how many instructions were executed and how much tape was "used", and an easy wasy to translate the program to other languages.
Download (0.28MB)
Added: 2007-05-31 License: GPL (GNU General Public License) Price:
890 downloads
TUR.ID. 0.1
TUR.ID. means TURing human IDentification is a textual, highly accessible alternative to visual CAPTCHAs. more>>
TUR.ID. means TURing human IDentification is a textual, highly accessible alternative to visual CAPTCHAs involving the completion of simple phrases and based on the language recognition features of the user.
<<less Download (0.037MB)
Added: 2007-05-03 License: LGPL (GNU Lesser General Public License) Price:
906 downloads
GD::SecurityImage 1.61
GD::SecurityImage is a security image (captcha) generator. more>>
GD::SecurityImage is a security image (captcha) generator.
SYNOPSIS
use GD::SecurityImage;
# Create a normal image
my $image = GD::SecurityImage->new(width => 80,
height => 30,
lines => 10,
gd_font => giant);
$image->random($your_random_str);
$image->create(normal => rect);
my($image_data, $mime_type, $random_number) = $image->out;
or
# use external ttf font
my $image = GD::SecurityImage->new(width => 100,
height => 40,
lines => 10,
font => "/absolute/path/to/your.ttf",
scramble => 1);
$image->random($your_random_str);
$image->create(ttf => default);
$image->particle;
my($image_data, $mime_type, $random_number) = $image->out;
or you can just say (most of the public methods can be chained)
my($image, $type, $rnd) = GD::SecurityImage->new->random->create->particle->out;
to create a security image with the default settings. But that may not be useful. If you require the module, you must import it:
require GD::SecurityImage;
GD::SecurityImage->import;
The module also supports Image::Magick, but the default interface uses the GD module. To enable Image::Magick support, you must call the module with the use_magick option:
use GD::SecurityImage use_magick => 1;
If you require the module, you must import it:
require GD::SecurityImage;
GD::SecurityImage->import(use_magick => 1);
The module does not export anything actually. But import loads the necessary sub modules. If you don t import, the required modules will not be loaded and probably, youll die().
The (so called) "Security Images" are so popular. Most internet software use these in their registration screens to block robot programs (which may register tons of fake member accounts). Security images are basicaly, graphical CAPTCHAs (Completely Automated Public Turing Test to Tell Computers and Humans Apart). This module gives you a basic interface to create such an image. The final output is the actual graphic data, the mime type of the graphic and the created random string. The module also has some "styles" that are used to create the background (or foreground) of the image.
If you are an Authen::Captcha user, see GD::SecurityImage::AC for migration from Authen::Captcha to GD::SecurityImage.
This module is just an image generator. Not a captcha handler. The validation of the generated graphic is left to your programming taste.
<<lessSYNOPSIS
use GD::SecurityImage;
# Create a normal image
my $image = GD::SecurityImage->new(width => 80,
height => 30,
lines => 10,
gd_font => giant);
$image->random($your_random_str);
$image->create(normal => rect);
my($image_data, $mime_type, $random_number) = $image->out;
or
# use external ttf font
my $image = GD::SecurityImage->new(width => 100,
height => 40,
lines => 10,
font => "/absolute/path/to/your.ttf",
scramble => 1);
$image->random($your_random_str);
$image->create(ttf => default);
$image->particle;
my($image_data, $mime_type, $random_number) = $image->out;
or you can just say (most of the public methods can be chained)
my($image, $type, $rnd) = GD::SecurityImage->new->random->create->particle->out;
to create a security image with the default settings. But that may not be useful. If you require the module, you must import it:
require GD::SecurityImage;
GD::SecurityImage->import;
The module also supports Image::Magick, but the default interface uses the GD module. To enable Image::Magick support, you must call the module with the use_magick option:
use GD::SecurityImage use_magick => 1;
If you require the module, you must import it:
require GD::SecurityImage;
GD::SecurityImage->import(use_magick => 1);
The module does not export anything actually. But import loads the necessary sub modules. If you don t import, the required modules will not be loaded and probably, youll die().
The (so called) "Security Images" are so popular. Most internet software use these in their registration screens to block robot programs (which may register tons of fake member accounts). Security images are basicaly, graphical CAPTCHAs (Completely Automated Public Turing Test to Tell Computers and Humans Apart). This module gives you a basic interface to create such an image. The final output is the actual graphic data, the mime type of the graphic and the created random string. The module also has some "styles" that are used to create the background (or foreground) of the image.
If you are an Authen::Captcha user, see GD::SecurityImage::AC for migration from Authen::Captcha to GD::SecurityImage.
This module is just an image generator. Not a captcha handler. The validation of the generated graphic is left to your programming taste.
Download (0.060MB)
Added: 2006-07-31 License: Perl Artistic License Price:
1180 downloads
GBrainFuck 0.3.1
GBrainFuck is a BrainFuck language interpreter. more>>
The GBrainFuck interpreter (gbf for short) is an interpreter for this language. It is more memory-effective than processor-effective, and it has room for optimization (especially on the code dealing with "[" and "]").
The interpreter is very like a Turing machine: it has an infinite tape, divided in cells that contain the value 0, which can move forward and backward; also, it has a controller unit, that reads, writes and moves the tape. Data in the cells are the size an int in the host machine (usually 32- or 64-bit)
Along with the interpreter, I put various BrainFuck sample programs, of which one of the most intersting is the BrainFuck interpreter in BrainFuck. I hope you enjoy.
<<lessThe interpreter is very like a Turing machine: it has an infinite tape, divided in cells that contain the value 0, which can move forward and backward; also, it has a controller unit, that reads, writes and moves the tape. Data in the cells are the size an int in the host machine (usually 32- or 64-bit)
Along with the interpreter, I put various BrainFuck sample programs, of which one of the most intersting is the BrainFuck interpreter in BrainFuck. I hope you enjoy.
Download (0.016MB)
Added: 2005-04-14 License: GPL (GNU General Public License) Price:
1653 downloads
Argh! 0.2.3
Argh! is an esoteric programming language. more>>
Argh! is an esoteric programming language in the spirit of Befunge, Brainfuck, and friends. Argh! project is a nice and simple language with two dimensional code-flow, a combined code/data array, an infinite stack, regular characters for all instructions, no strange braces or symbols, no unnecessary arithmetic operators (add and sub are all you need), and countless other features it doesnt have.
The distribution includes interpreters for Argh! and Aargh! (an extended Argh! that is most likely Turing complete), the official specification, editing modes for emacs and vim, and lots of examples.
Installation
To build the interpreters simply type make. This will produce two binaries: `argh the Argh! interpreter and `aargh the extended Argh! (Aargh!) interpreter. For instructions on installing the Emacs Argh! mode please look at the comments in `argh-mode.el.
Usage
Usage is simple, just call the interpreter with the filename of the Argh!-program as first argument:
$ argh ./examples/hello.agh
If the interpreter gets called with no argument, it reads the Argh!-program from stdin.
You can even put "#!/path/to/argh-interpreter" in the first line of your code and make the Argh! program executable. (At least on systems, which understand #!-magic).
<<lessThe distribution includes interpreters for Argh! and Aargh! (an extended Argh! that is most likely Turing complete), the official specification, editing modes for emacs and vim, and lots of examples.
Installation
To build the interpreters simply type make. This will produce two binaries: `argh the Argh! interpreter and `aargh the extended Argh! (Aargh!) interpreter. For instructions on installing the Emacs Argh! mode please look at the comments in `argh-mode.el.
Usage
Usage is simple, just call the interpreter with the filename of the Argh!-program as first argument:
$ argh ./examples/hello.agh
If the interpreter gets called with no argument, it reads the Argh!-program from stdin.
You can even put "#!/path/to/argh-interpreter" in the first line of your code and make the Argh! program executable. (At least on systems, which understand #!-magic).
Download (0.021MB)
Added: 2005-04-15 License: GPL (GNU General Public License) Price:
1653 downloads
N-genes 0.9
n-genes is a powerful Genetic Algorithms and Programming toolkit written for Java 5. more>>
n-genes is a powerful Genetic Algorithms and Programming toolkit written for Java 5.
Using advanced object oriented techniques, like generics and introspection, it is one the simplest system to learn and use. N-geness design allows fast coding and a total flexibility.
n-genes is an open-source project released under GPL. It is free of charges.
Main features:
Stack-based Genetic Programming
The Genetic Programming implemented in n-genes relies on a linear postfix programs, close to Forth or Postscript programming languages. They allow the following advantages:
- High-level and turing-complete language (through flow-control instructions);
- Extendable and customisable instruction set;
- Possibility of using faster and simpler GA operators;
- Efficient bloat removing/controlling algorithms.
Modularity and Dynamic Config Files
All parts of evolutionary computing have been made components, through " Design Patterns" methodology. The benefits are:
- Separation of the behaviour from the representation, i.e. we can use the same operators for a GA doubles individual or for a GP problem;
- Short and readable code, since each object represents only a single operation and therfore has few and shorts methods.
- The possibility to change the components or their behaviour during evolution, for example changing dynamically the size of a population or using self-adaptating mutation operators.
The n-genes platform is coupled with a dynamic config file system. This system is able to instanciate whatever class, passing arbitrary parameters of whaterver types, whithout needing to extend the parser. Object introspection is used at initialisation.
Performances Optimisations
n-genes was written with high performance computing in mind. Here are the optimisations you get for free, using our platform:
- Object-recycling memory management, eliminating the time spent on objects allocation and garbage-collections;
- Efficient individual-level fitness cache, the fitness is lazy-computed and cached until the individual is mutated;
- Population-level individual cache, saving computation time when the population diversity dimish.
<<lessUsing advanced object oriented techniques, like generics and introspection, it is one the simplest system to learn and use. N-geness design allows fast coding and a total flexibility.
n-genes is an open-source project released under GPL. It is free of charges.
Main features:
Stack-based Genetic Programming
The Genetic Programming implemented in n-genes relies on a linear postfix programs, close to Forth or Postscript programming languages. They allow the following advantages:
- High-level and turing-complete language (through flow-control instructions);
- Extendable and customisable instruction set;
- Possibility of using faster and simpler GA operators;
- Efficient bloat removing/controlling algorithms.
Modularity and Dynamic Config Files
All parts of evolutionary computing have been made components, through " Design Patterns" methodology. The benefits are:
- Separation of the behaviour from the representation, i.e. we can use the same operators for a GA doubles individual or for a GP problem;
- Short and readable code, since each object represents only a single operation and therfore has few and shorts methods.
- The possibility to change the components or their behaviour during evolution, for example changing dynamically the size of a population or using self-adaptating mutation operators.
The n-genes platform is coupled with a dynamic config file system. This system is able to instanciate whatever class, passing arbitrary parameters of whaterver types, whithout needing to extend the parser. Object introspection is used at initialisation.
Performances Optimisations
n-genes was written with high performance computing in mind. Here are the optimisations you get for free, using our platform:
- Object-recycling memory management, eliminating the time spent on objects allocation and garbage-collections;
- Efficient individual-level fitness cache, the fitness is lazy-computed and cached until the individual is mutated;
- Population-level individual cache, saving computation time when the population diversity dimish.
Download (0.72MB)
Added: 2005-12-01 License: GPL (GNU General Public License) Price:
1423 downloads
Statistics::Smoothing::SGT 2.1.2
Statistics::Smoothing::SGT is a Simple Good-Turing (SGT) smoothing implementation. more>>
Statistics::Smoothing::SGT is a Simple Good-Turing (SGT) smoothing implementation.
SYNOPSIS
Basic Usage
use Statistics::Smoothing::SGT
my $sgt = new Statistics::Smoothing::SGT($frequencyClasses, $total);
$sgt->calculateValues();
$probabilities = $sgt->getProbabilities();
$newFrequencies = $sgt->getNewFrequencies();
$nBar = $sgt->getNBar();
<<lessSYNOPSIS
Basic Usage
use Statistics::Smoothing::SGT
my $sgt = new Statistics::Smoothing::SGT($frequencyClasses, $total);
$sgt->calculateValues();
$probabilities = $sgt->getProbabilities();
$newFrequencies = $sgt->getNewFrequencies();
$nBar = $sgt->getNBar();
Download (0.019MB)
Added: 2007-05-22 License: Perl Artistic License Price:
888 downloads
Alan 1.0
Alan project is a Turing machine implementation. more>>
Alan project is a Turing machine implementation.
Alan is an implementation of a Turing machine for educational purposes.
It was created as a programing project at the University of Aplied Sciences Rosenheim.
Features include an easy-to-use GUI and a reusable Turing Machine component. Additionally, Alan contains many example programs for the Turing machine.
<<lessAlan is an implementation of a Turing machine for educational purposes.
It was created as a programing project at the University of Aplied Sciences Rosenheim.
Features include an easy-to-use GUI and a reusable Turing Machine component. Additionally, Alan contains many example programs for the Turing machine.
Download (0.37MB)
Added: 2006-10-25 License: GPL (GNU General Public License) Price:
1095 downloads
Alana 1.0
Alana is a Turing Machine simulator. more>>
A highly responsive Turing machine simulator written in Tcl/Tk. Contains many examples (unary and binary addition, subtraction, multiplication, a 5-state busy beaver, 2 string parsing examples, divisibility test, primality test), a theoretical introduction to Turing machines, a proof of the undecidability of the halting problem and pointers to further literature.
<<less Download (0.025MB)
Added: 2005-06-06 License: GPL (GNU General Public License) Price:
1601 downloads
Theo 0.2.1
Theo project is a simulator for Turing Machines and Finite Automatons. more>>
Theo project is a simulator for Turing Machines and Finite Automatons.
Its a simulator for various machine concepts found in theoretical computer science.
It includes support for Turing Machines and Finite Automatons, both deterministic and non-deterministic.
Turing Machines support multiple tapes, which can be grouped. You can create new machines and edit existing ones either in a graphical way by editing the machines graph, or via the machines delta table.
In addition, there is a tape display that is used to edit machine input as well as display machine output.
When simulating non-deterministic machines, the calculation tree can be displayed and the user can select possible configurations in the tree.
<<lessIts a simulator for various machine concepts found in theoretical computer science.
It includes support for Turing Machines and Finite Automatons, both deterministic and non-deterministic.
Turing Machines support multiple tapes, which can be grouped. You can create new machines and edit existing ones either in a graphical way by editing the machines graph, or via the machines delta table.
In addition, there is a tape display that is used to edit machine input as well as display machine output.
When simulating non-deterministic machines, the calculation tree can be displayed and the user can select possible configurations in the tree.
Download (0.77MB)
Added: 2006-10-11 License: GPL (GNU General Public License) Price:
1112 downloads
Ghost Diagrams 0.8
Ghost Diagrams is a program that takes sets of tiles and tries to find patterns into which they may be formed. more>>
Ghost Diagrams is a project that takes sets of tiles and tries to find patterns into which they may be formed. The patterns it finds when given randomly chosen tiles are often surprising.
It turns out that tiling patterns are a form of computation of equal power to Turing machines, lambda calculus, and cellular automata. For example, here is a tileset implementing "Rule 110", a cellular automaton known to be capable of universal computation.
Considerations similar to the halting problem and Godels theorem apply. There is no upper limit to their capacity to surprise us. Furthermore, tiles have an intuitive quality that other forms of computation lack. You can see how they fit together.
An organism is more than the sum of its organs. When the organs are fitted together, the organism becomes something more. This surprising something more we call "spirit" or "ghost". Ghost Diagrams finds the ghosts implicit in simple sets of tiles.
<<lessIt turns out that tiling patterns are a form of computation of equal power to Turing machines, lambda calculus, and cellular automata. For example, here is a tileset implementing "Rule 110", a cellular automaton known to be capable of universal computation.
Considerations similar to the halting problem and Godels theorem apply. There is no upper limit to their capacity to surprise us. Furthermore, tiles have an intuitive quality that other forms of computation lack. You can see how they fit together.
An organism is more than the sum of its organs. When the organs are fitted together, the organism becomes something more. This surprising something more we call "spirit" or "ghost". Ghost Diagrams finds the ghosts implicit in simple sets of tiles.
Download (0.033MB)
Added: 2006-02-19 License: GPL (GNU General Public License) Price:
1353 downloads
Visual Automata Simulator 1.2
Visual Automata Simulator is a DFA, NFA and TM simulator. more>>
Visual Automata Simulator is a tool for simulating, visualizing and transforming finite state automata and Turing Machines.
Visual Automata Simulator is a DFA, NFA and TM simulator.
Main features:
- Creates, simulates and transforms DFA and NFA machines
- Creates and simulates TM
- Batch tests for TM: useful features to test a bunch of files quickly!
- Easy-to-use GUI interface (multi-documents)
- Smart links between objects
- Machines can be drawn using the mouse - and resized at any time
- Multiple machines can be created in a single document
- Multiple documents can be opened at the same time
- Documents can be saved and reloaded from disk
- Debug mode to see exactly how the machine is working (each step has a different color)
- MacOS X GUI compliant.
Enhancements:
- FA and TM machine can be exported to EPS file
- integrated update manager
- preferences: can specify the character used to define an epsilon transition
- fixed a bug where epsilon transition were not considered when starting directly from a state instead of following a non-epsilon transition.
<<lessVisual Automata Simulator is a DFA, NFA and TM simulator.
Main features:
- Creates, simulates and transforms DFA and NFA machines
- Creates and simulates TM
- Batch tests for TM: useful features to test a bunch of files quickly!
- Easy-to-use GUI interface (multi-documents)
- Smart links between objects
- Machines can be drawn using the mouse - and resized at any time
- Multiple machines can be created in a single document
- Multiple documents can be opened at the same time
- Documents can be saved and reloaded from disk
- Debug mode to see exactly how the machine is working (each step has a different color)
- MacOS X GUI compliant.
Enhancements:
- FA and TM machine can be exported to EPS file
- integrated update manager
- preferences: can specify the character used to define an epsilon transition
- fixed a bug where epsilon transition were not considered when starting directly from a state instead of following a non-epsilon transition.
Added: 2005-11-14 License: Freeware Price:
1447 downloads
DL/SQL 1.0.1
DL/SQL is a declarative programming language based on top of a SQL database. more>>
DL/SQL is declarative, turing-complete programming language based on top of SQL database. The main idea is to store both program and data in one SQL table and make all the computations in it.
The current version of interpreter written in PHP contains quasi-lazy evaluation and simple caching.
The syntax was inspired by LISP and bash. Sounds strange? For example,
(* (+ 2 4 (#FACT 4)) 3)
means (2 + 4 + fact(4)) * 3 where fact is user-defined function for factorial.
As youve probably noticed, DL/SQL has got prefix (polish) notation with compulsory bracketing. That means, in front any name of function there must be opening bracket and after last parameter of a function there must be closing bracket. With this rule its really easy to implement variable-length argument lists.
For real deployment its necessary to change the core according to your needs - some special constructions are always necessary. Fortunatelly the core is flexible and easily extendable. Right now DL/SQL uses MySQL as its backend. Therere only several calls to DB, changing them is work for few minutes so porting DL/SQL to lets say PostgreSQL is piece of cake.
Therere only two API calls:
rpn_init()
clears all the cached values (actually sets the counted bit to false).
rpn_eval($expression)
evaluates entered DL/SQL expression. For using DL/SQL interpreter its necessary to include file rpnparser.phtml in your project. For easy implementation I also advise you to include file include/setup.phtml which contains all the necassary stuff for connecting to database and setting the directories. Without this file, youll have to do all the things yourself!
<<lessThe current version of interpreter written in PHP contains quasi-lazy evaluation and simple caching.
The syntax was inspired by LISP and bash. Sounds strange? For example,
(* (+ 2 4 (#FACT 4)) 3)
means (2 + 4 + fact(4)) * 3 where fact is user-defined function for factorial.
As youve probably noticed, DL/SQL has got prefix (polish) notation with compulsory bracketing. That means, in front any name of function there must be opening bracket and after last parameter of a function there must be closing bracket. With this rule its really easy to implement variable-length argument lists.
For real deployment its necessary to change the core according to your needs - some special constructions are always necessary. Fortunatelly the core is flexible and easily extendable. Right now DL/SQL uses MySQL as its backend. Therere only several calls to DB, changing them is work for few minutes so porting DL/SQL to lets say PostgreSQL is piece of cake.
Therere only two API calls:
rpn_init()
clears all the cached values (actually sets the counted bit to false).
rpn_eval($expression)
evaluates entered DL/SQL expression. For using DL/SQL interpreter its necessary to include file rpnparser.phtml in your project. For easy implementation I also advise you to include file include/setup.phtml which contains all the necassary stuff for connecting to database and setting the directories. Without this file, youll have to do all the things yourself!
Download (0.021MB)
Added: 2005-04-14 License: BSD License Price:
1655 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 1
- 1
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above turing search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed