Search Results for "bit"

CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. It comprises powerful input interpretation options. Compliant with Ross Williams' Rocksoft(tm) model of parametrised CRC algorithms.

Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS This project is moved to github: https://lp-solve.github.io/

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a pair of stack and queue. ...

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range.

...Draw a binary integer from a cell going upright, then explore the allowed transforms which may lead you to a factored state in 2 dimensions, from the lowest digit of the 2 odd integers both upright and upleft, its factors, and in the 2d space they are rectangle edges of, those pixels/digitbits must be on when there is an on bit somewhere downleft and downright after crossing empty cells, but if it finds either whole diagonal row empty then it must also be empty/zerodigit. The 2 main rules are: Any 2 cells below may both turn off and turn on the one above, or the reverse, and any on cell may move horizontally to an empty cell.

...As a result its main focus is ease of use for math problems. To download AAL check out the source code repository. There are versions available for windows and linux with both 32 and 64 bit native binaries: http://svn.code.sf.net/p/aal-lang/code/trunk/bin/

...Fine control over thread/CPU usage; unlimited precision; smooth/random/function coloring; supports color map files (over 1600 available); many image file formats. For any Java 1.5+ (32/64 Bit) VM.

This is a conversion-to-binary training game prototype. Random bits appear, and you must shoot them where they fit onto various bytes (given in octal, hex or even bit ops, decimal or Ascii). Shoot wrongly and you lose that byte, or get it right and win.

Provides efficient, effective implementations of 32- and 64-bit hash functions based on Rabin fingerprints / irreducible polynomials, in Java. Also provides integration with java.security.MessageDigest API.

Mandel is a command-line program for generating Mandelbrot set fractals - support for Julia sets is coming soon. Output is in the form of 8 bit greyscale Device Independent Bitmaps, which can be readily viewed with many common graphics programs.

The Random Bit Generator Test Suite will take in large blocks of binary data and attempt to tell the user what is not random about them. Code developers, mathematicians and statisticans welcome to help.