He Makes Himself Alienated: A Deconstructive Reading of An Enemy of the People

By analyzing An Enemy of the People in a deconstructive approach,this thesis endeavors to dismantle the binary oppositions long established in the text:minority privileging over majority,morality over authority and verity over falsity.It comes to the conclusion that the meaning of the drama is undecidable,which helps to arrive at new findings in literary studies.

Further results on Hilbert’s Tenth Problem

Hilbert’s Tenth Problem(HTP)asks for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer coefficients has solutions over the ring Z of integers.This was finally solved negatively by Matiyasevich in 1970.In this paper we obtain some further results on HTP over Z.We prove that there is no algorithm to determine for any P(z1,...,z9)∈Z[z1,...,z9]whether the equation P(z1,...,z9)=0 has integral solutions with z9≥0.Consequently,there is no algorithm to test whether an arbitrary polynomial Diophantine equation P(z1,...,z11)=0(with integer coefficients)in 11 unknowns has integral solutions,which provides the best record on the original HTP over Z.We also prove that there is no algorithm to test for any P(z1,...,z17)∈Z[z1,...,z17]whether P(z12,...,z172)=0 has integral solutions,and that there is a polynomial Q(z1,...,z20)∈Z[z1,...,z20]such that{Q(z12,...,z202):z1,...,z20∈Z}∩{0,1,2,...}coincides with the set of all primes.

Some Undecidable Problems on Approximability of NP Optimization Problems

In this paper some undecidable problems on approximability of NP op-timization problems are investigated. In particular, the following problems are all undecidable: (1) Given an NP optimization problem, is it approal-mable in polynomial time? (2) For any polynomialtime computable function r(n), given a polynomial time approkimable NP optimization problem, has it a polynomialtime approximation algorithm with approkimation performance ratio r(n) (r(n)-approkimable)? (3) For any polynomial-time computable func-tions r(n), r'(n), where r'(n) < r(n) a.e., given an r(n)-approkimable NP opti-mization problem, is it r'(n)-approalmable?

The main tasks of a semiotics of artificial intelligence

The article indicates the essential tasks of a semiotics of artificial intelligence:studying the way it simulates the expression of intelligence;the way it produces content that is creatively endowed;the ideological assumptions of artificial intelligence within the culture that produces it.Artificial intelligence is,from a semiotic point of view,the predominant technology of fakery in the current era.On the strength of its studies on the false,semiotics can therefore also be applied to the analysis of the fake that,in increasingly sophisticated forms,is produced through artificial intelligence and through the deep learning of neural networks.The article focuses on the adversarial ones,trying to highlight their ideological assumptions and cultural developments,which seem to indicate the entry of human societies and cultures into the‘realm of the absolute fake'.

PREMONITORY DEPENDENCY OF HISTORICAL DATABASE AND ITS MATHEMATICAL PROPERTIES

<正> To process the data with strong historical features, such as data in earthquake research,weather forecast, medical records and census, a new mathematical model of historical datasystem is proposed. This model can be characterized as ' relational database with timemark + histotical rule base = historical database', and it is easy to implement. The formaldescription of historical database and a special class of historical rules-premonitory de-pendency (abbreviated as PD)-are discussed, the poperties and inference axioms of PDare investigated. The soundness and completeness of the axioms are proved. The problemsabout the true-set of historical rules, such as the problems of emptyness, infiniteness,equivalence and containment are proved to be undecidable.