We continue an investigation into resource-bounded Kolmogorov complexity [ABK06], which highlights the close connections between circuit complexity and Levin’s time-bounded Kolmogorov complexity measure Kt (and other measures with a similar flavor), and also exploits derandomization techniques to provide new insights regarding Kolmogorov complexity. The Kolmogorov measures that have been introd...

this research is intended to investigate educational change in complexity paradigm. complexity paradigm provide a new perspective for thinkers to changing the world and it's phenomena and many of theorists present new viewpoints in variant scientific domains according to the main components of this paradigm. for this, the researcher first investigates and criticizes educational change theories ...

sciences exist to demonstrate the fundamental order underlying nature. chaos/complexity theory is a novel and amazing field of scientific inquiry. notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (retrieved from http://www.inc...

Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program) complexity of datalog in its main context so far, on finite databases, is well known to be in EXPTIME. We research the complexity of datalog on infinite databases, motivated by possible applications of datalog to infinite structures (e.g. linear orders) in temporal a...

Detecting races is important for debugging explicit shared-memory parallel programs, because the races result in unintended non-deterministic executions of the programs. Previous on-they techniques to detect races in parallel programs with inter-thread coordination show serious space overhead in two components of complexity, and can not guarantee that, in an execution instance, the race detecte...

In this paper we describe a program analysis system called CLPKIDS, that is based on program dependence analysis, to support development of software engineering tools for understanding, testing, debugging, maintenance and complexity measurement of concurrent logic programs.

The concept of homogeneous multi-adjoint logic program is introduced, and a procedure to homogenize an arbitrary multi-adjoint logic program is presented. The procedure is proved to preserve models and, moreover, some complexity results are given.