The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
We present a procedure for computing the sceptical "ideal semantics" for argumentation in assumption-based frameworks. This semantics was first proposed for logic program...
This paper outlines a symbolic computational theory for recognizing variable spatial environments-The Theory of Cognitive Prism, (Dong 2005). This theory defines distance and orie...
We show that the "fractal" behavior of Internet traffic can be efficiently and practically employed to significantly reduce packetloss. Thanks to recent advances in the t...
: Currently computers are changing from single isolated devices to entry points into a world wide network of information exchange and business transactions called the World Wide We...