相关论文: Problems of Testology

We introduce the concept of protometric and present some properties of protometrics.

We survey results on the hardness of approximating combinatorial optimization problems.

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Difficulty of safety-related software standards to help producing software for safe systems is discussed. Some research activity and other actions are proposed to focus on and possibly resolve long-lasting related problems.

Tests for proportional hazards assumption concerning specified covariates or groups of covariates are proposed. The class of alternatives is wide: log-hazard rates under different values of covariates may cross, approach, go away. The data…

Some question about representations of $p$-adic groups are discussed.

We will review some of the theoretical progresses that have been in the study of complex systems in physics and of their applications to biology.

We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.

Understanding program code is a complicated endeavor. As such, myriad different factors can influence the outcome. Investigations of program comprehension, and in particular those using controlled experiments, have to take these factors…

Some Open Problems Concerning Orthogonal Polynomials.

We point out that the ideas underlying some test procedures recently proposed for testing post-model-selection (and for some other test problems) in the econometrics literature have been around for quite some time in the statistics…

We discuss the (twisted) weak positivity theorem. We also treat some applications.

The field of property testing of probability distributions, or distribution testing, aims to provide fast and (most likely) correct answers to questions pertaining to specific aspects of very large datasets. In this work, we consider a…

The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised…

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…

The main purpose of this paper is to investigate the stability problem of some functional equations that appear in the characterization problem of information measures.

A novel approach to an old symmetry problem is developed. A new proof is given for the following symmetry problem, studied earlier.

Many statistical issues arise in the analysis of Particle Physics experiments. We give a brief introduction to Particle Physics, before describing the techniques used by Particle Physicists for dealing with statistical problems, and also…

We study some topological properties of attractors.

We list a few things that we do not understand about stars and that most people ignore. These are all hard problems. We can learn more cosmology by working on them to reduce the systematic errors they introduce than by trying to derive…