相关论文: Computability Superselection Rule and its physical…

We give a selection of major open problems involving selective properties, diagonalizations, and covering properties for sets of real numbers. This is a revision of the version published as a chapter in the book \textbf{Open Problems in…

A computer simulation, such as a genetic algorithm, that uses IEEE standard floating-point arithmetic may not produce exactly the same results in two different runs, even if it is rerun on the same computer with the same input and random…

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

We will give a simple proof of the ambiguous class number formula.

In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanations for a series of observations with the same domain. The…

I tentatively suggest that the superposition principle of quantum mechanics is explicable in a mathematically natural way if it is possible to understand probability amplitudes as complex-valued logarithms. This notion is inspired by the…

While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty…

A connection between fractional supersymmetric quantum mechanics and ordinary supersymmetric quantum mechanics is established in this Letter.

Resubmitted as hep-ph/9502316. Removed from hep-th. Incorrigibly inept submitter publicly excoriated.

This paper has been withdrawn by the author due to a mistake in the section 4.

A comment on the paper Appl. Phys. Lett. 104, 161116 (2014).

Reproducibility is one of the core dimensions that concur to deliver Trustworthy Artificial Intelligence. Broadly speaking, reproducibility can be defined as the possibility to reproduce the same or a similar experiment or method, thereby…

Paper is withdrawn and superseded by EFI-94-36 which will appear shortly with the new hep-th number hep-th/9407111 .

There is a technical issue in the analysis that is not easily fixable. We, therefore, withdraw the submission. Sorry for the inconvenience.

In the recently posted arXiv:2312.04495v3 [1], its authors used a computer code written by me supplied to them by the authors of Ref. [2], and claimed that the results that they obtained invalidate the results and conclusions presented in…

This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines,…

Reproducibility of computational studies is a hallmark of scientific methodology. It enables researchers to build with confidence on the methods and findings of others, reuse and extend computational pipelines, and thereby drive scientific…

The integration of machine learning techniques in materials discovery has become prominent in materials science research and has been accompanied by an increasing trend towards open-source data and tools to propel the field. Despite the…