Quality-time-complexity universal intelligence measurement

A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff’s theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameterless theory of universal Artificial Intelligence. We give strong arguments that ...

A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Time Complexity of Constraint Satisfaction via Universal Algebra

The exponential-time hypothesis (ETH) states that 3-SAT is not solvable in subexponential time, i.e. not solvable in O(c) time for arbitrary c > 1, where n denotes the number of variables. Problems like k-SAT can be viewed as special cases of the constraint satisfaction problem (CSP), which is the problem of determining whether a set of constraints is satisfiable. In this paper we study the wor...

On interaction complexity, (space-time) resolution and intelligence

The recognition and assessment of cognitive (and ultimately intelligent) interaction require transmission of information, or communication. We distinguish between the evaluation of cognition as a peer and as an observer, and analyse several issues that might cause a failure in recognising (and properly assessing) cognition, such as the interface, the time and space resolution, the observer’s li...

Assessment Of Intelligence Complexity In Embedded Intelligent Real-time Systems

Intelligent systems and their applications are proliferating. Embedded Intelligent Real-Time Systems (EIRTS) are one type of intelligent system. Defining and measuring the complexity of this kind of system may help with better design, development, maintenance, and performance of EIRTS. In this paper, we propose a set of evaluation criteria to measure the complexity of Embedded Intelligent Real-...