There are two methods of set prediction that are provably valid under the assumption of randomness: transductive conformal prediction and inductive conformal prediction. The former method is informationally efficient but often lacks computational efficiency. The latter method is, vice versa, computationally efficient but less efficient informationally. This talk discusses a new method, which we...

Formal features of semantics-related tasks of text processing are reviewed; NP-complete procedural complexity of the class is substantiated. To diminish procedural complexity, the rationale behind applied formal linguistic knowledge is demonstrated, based on the analogy of the knapsack problem and automated text abstracting. Versatile approach for text processing is proposed, considering relati...

Public communication is secure if a hostile third party cannot detect the informational content of the messages exchanged by the communicating parties. In Nash equilibrium, communication by computationally unbounded players cannot be secure. We assume complexity averse players, and show that a simple, secure and costless communication protocol becomes available as the marginal complexity cost t...

Very little is known about the distribution of functional DNA, RNA, and protein molecules in sequence space. The question of how the number and complexity of distinct solutions to a particular biochemical problem varies with activity is an important aspect of this general problem. Here we present a comparison of the structures and activities of eleven distinct GTP-binding RNAs (aptamers). By ex...

Automated text complexity assessment tools are of enormous practical value in solving the time-consuming task analyzing English informational texts for their at pre-reading stage. The present study depicts application automated analysis system TextEvaluator as an effective tool that helps analyze on eight dimensions follows: syntactic complexity; academic vocabulary; word unfamiliarity; concret...

Given copies of the same problem, does it take times the amount of resources to solve these problems? This is the direct sum problem, a fundamental question that has been studied in many computational models. We study this question in the simultaneous message (SM) model of communication introduced by Yao [Y79]. The equality problem for -bit strings is well known to have SM complexity . We prove...

There are two main informal ideas related to informational content of hard sets. The first says that a set of low informational content can not be hard or complete for a great enough complexity class because of lack of information accessible with bounded resources. One of the formalization of this idea is well-known Hartmanis Conjecture: Sparse sets are not Ccomplete if C is great enough comple...

Engagement during reading can be measured by the amount of time readers invest in the reading process. It is hypothesized that disengagement is marked by a decrease in time investment as compared with the demands made on the reader by the text. In this study, self-paced reading times for screens of text were predicted by a text complexity score called formality; formality scores increase with c...

Engagement during reading can be measured by the amount of time readers invest in the reading process. It is hypothesized that disengagement is marked by a decrease in time investment as compared with the demands made on the reader by the text. In this study, self-paced reading times for screens of text were predicted by a text complexity score called formality; formality scores increase with c...