[Savannah-register-public] [task #5246] Submission of NI

[Michael Jumper]

URL:
  <http://savannah.gnu.org/task/?func=detailitem&item_id=5246>

                 Summary: Submission of NI
                 Project: Savannah Administration
            Submitted by: zhangmaike
            Submitted on: Thu 02/09/06 at 20:43
         Should Start On: Thu 02/09/06 at 00:00
   Should be Finished on: Sun 02/19/06 at 00:00
                Category: Project Approval
                Priority: 5 - Normal
                  Status: None
                 Privacy: Public
             Assigned to: None
        Percent Complete: 0%
             Open/Closed: Open
                  Effort: 0.00

    _______________________________________________________

Details:

A new project has been registered at Savannah 
The project account will remain inactive until a site admin approve or
discard the registration.


######### REGISTRATION ADMINISTRATION #########

While this item will be useful to track the registration process, approving
or discarding the registration must be done using the specific "Group
Administration" page, accessible only to site administrators, effectively
logged as site administrators (superuser):

  <https://savannah.gnu.org/admin/groupedit.php?group_id=8349>


######### REGISTRATION DETAILS ######### 

Full Name:
----------
  NI

System Group Name:
-----------------
  not-intractable

Type:
-----
  non-GNU software & documentation

License:
-------- 
  GNU General Public License V2 or later

Description:
------------
  NI is a boolean algebra program which represents truth tables in a more
optimized way, allowing it to represent and compare boolean functions
involving hundreds of variables. Many problems involving large numbers of
variables are intractable with truth tables, since the complexity of the
problem is always 2^n for n variables. The complexity of the same problem
using NI's specialized representation only approaches 2^n as the boolean
function itself increases in complexity, but most functions which would
previously be considered intractable are now “not intractable” (the
meaning of the acronym NI).

On my 3 GHz P4 machine running GNU/Linux under 1 GB of RAM, it takes NI an
average of around 30-40 seconds to compute the truth tables for randomly
generated boolean functions involving 250 variables and 1024 operations
selected from AND, OR, NOT, NAND, and XOR. NI will parse input from stdin, as
well as from a file (for use with scripts). So far, the only known bugs
involve input parsing and are trivial. The internal boolean algebra routines
that do the actual math have been stable for at least a month now, failing no
test cases.

The current source can be downloaded from:
http://64.85.234.190:5680/ni.tar.gz


Other Software Required:
------------------------
  GNU readline library
ncurses (because of readline)
might depend on libpthread in the future








    _______________________________________________________

Reply to this item at:

  <http://savannah.gnu.org/task/?func=detailitem&item_id=5246>

_______________________________________________
  Message sent via/by Savannah
  http://savannah.gnu.org/