Artificial Intelligence
  home | services | products | resources | forum
 
about us | contact   
Particle
August 16th, 2017



www.theparticle.com
Main
Services
Products
Resources
Forum
About Us
Contact

Particle Revelation
Hardware Destruction
Quotes
Humor [alpha]
Murphy's Laws

Programming
Java
Java Data Structures
C# Data Structures
Database Design
Graphics Tutorial
Artificial Intelligence

Downloads
SQLRunner
Graphics Tutorials
Hacking Tutorials
Java Applets
MIDI Music
Gov & Misc Docs

Games
Chess Game
Asteroids
Tic-Tac-Toe
Tetris

Applets
DRAW!
FlightBox
pWobble 3D
pRunner
NYU HWs
Swarms
Geometry
Chaos
Machine Learning

Academic
CISC 7510X
CISC 7330X
OS (old)
AI (old)
App Dev (old)
C++ (old)
OOP (old)
Web (old)
Perl (old)
DBMS (old)
Perl (old)
ProgLangs (old)
PHP (old)
MltMedia (old)
Oracle (old)

Misc
Privacy Policy
Publications
profphreak.com



This section is where all the AI related stuff will be posted.

AI Related Resources:


Prof.Phreak
This is the next generation of an Eliza like program. It answers your questions, etc. Has a calculation engine (it knows what "two plus two" is), operational commands (it will let you know correct time if asked), and a relatively large database. Download available from the products page.


Z Compiler
This is a sample compiler for a compiler class that I happened to be teaching... Actually, it's 2 compilers, both for more or less the same language (Z language). One is 100% hand written in C, another uses LEX and YACC to generate scanner and parser respectively. The output of the compiler is an assembly program (NASM or TASM) that can be readily assembled, linked, and ran on any DOS/Win32 system. The Z language is a made up 'simple' language, which still possesses enough expressive power to write non-trivial programs (well, not completely non-trivial). A sample Z program to find all prime numbers less than the number you enter is: 

read m
n = 2
while n < m {
    j = n - 1
    i = 2
    p = 1
    while (i < j) * p{
        j = n / i
        p = n - j * i
        i = i + 1
    }
    if p {
        write n
    }
    n = n + 1
}

To make use of the compiler, you'll need NASM and/or TASM Assemblers. And if you're interested in the lex/yacc version, you'll also need these two programs. I've ziped up the relevant files below, but you should still check out appropriate distribution sites for full packages of these programs.

nasm_win32.zip - DOS/Win32 version of NASM executable and reference document. Don't forget to visit the official NASM page for full distribution.

lex_bison_win32.zip - Win32 version of LEX and YACC executables. If you have UNIX (Linux), then you probably already have these programs. Don't forget to visit the official LEX & YACC distribution sites for full packages and documentation.


LL Chess
This Chess game was written by Leonid Liberman in 100% assembly over many years.


brain.zip
This is a theorem prover. (or theorem resolver) It has a bug related to tautologies (it incorrectly handles them).


expert.zip
This is an expert system shell. It has bugs in it, but unfortunately, I forgot which.


prolog_expert.zip
This is an expert system shell in Prolog. It was created for a graduate expert systems class. (GNU Prolog)







© 1996-2016 by End of the World Production, LLC.