I present algorithms for automated long-term behavior prediction which can recognize when a simulation has run long enough to produce a representative behavior sample, characterize the behavior, and determine whether this behavior will continue forever, or eventually terminate or otherwise change its character. I have implemented these algorithms in a working program which does longterm behavio...

We prove a number of results in effective randomness, using methods in which Π1 classes play an essential role. The results proved include the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.

Many planning problems are most naturally solved using an interative loop of actions. For example, a natural plan to unload a truckload of boxes is to repeatedly remove a box until the truck is empty. The problem of planning with loops has been investigated in the context of classical planning [Wilkins, 1988] as well as in the context of reactive planning [Musliner, 1994] but not for decision-t...

We propose an accurate close-up shot detection method with parallel distributed processing. Straightforward approaches that divide a video into multiple fixed length partitions are not accurate because the partition boundaries terminate events before they actually end. To solve this problem, our method alters the shot based partitions to ensure complete coverage. Our method offers 2 processes f...

We show how to determine the k-th bit of Chaitin’s algorithmically random real number Ω by solving k instances of the halting problem. From this we then reduce the problem of determining the k-th bit of Ω to determining whether a certain Diophantine equation with two parameters, k and N , has solutions for an odd or an even number of values of N . We also demonstrate two further examples of Ω i...

Some new hypotheses, which are also equal to Four Color Problem, will be introduced and their introduction will be proved in this article. These hypotheses try to connect Four Color Problem with either the existence or the absence of either Euler cycles or Hamilton circuits in the graph.

A sumtest for a discrete semimeasure P is a function f mapping bitstrings to non-negative rational numbers such that ∑ P (x)f(x) ≤ 1 . Sumtests are the discrete analogue of Martin-Löf tests. The behavior of sumtests for computable P seems well understood, but for some applications lower semicomputable P seem more appropriate. In the case of tests for independence, it is natural to consider uppe...

We show that there are computably enumerable (c.e.) sets with maximum initial segment Kolmogorov complexity amongst all c.e. sets (with respect to both the plain and the prefix-free version of Kolmogorov complexity). These c.e. sets belong to the weak truth table degree of the halting problem, but not every weak truth table complete set has maximum initial segment Kolmogorov complexity. Moreove...

Methods are given for statically analyzing sets of database production rules to determine if the rules are (1) guaranteed to terminate, (2) guaranteed to produce a unique nal database state, and (3) guaranteed to produce a unique stream of observable actions. If the analysis determines that one of these properties is not guaranteed, it isolates the rules responsible for the problem and determin...

Runtime enforcement is an effective method to ensure the compliance of program with user-defined security policies. In this paper we show how the stream event processor tool BeepBeep can be used to monitor the security properties of Java programs. The proposed approach relies on AspectJ to generate a trace capturing the program’s runtime behavior. This trace is then processed by BeepBeep, a com...