相关论文: Computability Superselection Rule and its physical…
This paper has been withdrawn since it was an inadvertant double submission. An updated version of the original submission can be found at quant-ph/0505131
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…
Reproducibility is a crucial aspect of scientific research that involves the ability to independently replicate experimental results by analysing the same data or repeating the same experiment. Over the years, many works have been proposed…
This paper has been withdrawn because it is a duplicate of [hep-ph/0609266].
In this paper, a new criterion is given to determine the $p-$rationality of some complex cubic number fields in terms of $ p-$divisibility of certain terms of a third-order recurrence sequence, several illustrated examples are…
This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.
The main purpose of this work is to introduce and analyse some generalizations of diverse superposition rules for first-order differential equations to the setting of second-order differential equations. As a result, we find a way to apply…
In this paper we shall relate computational complexity to the principle of natural selection. We shall do this by giving a philosophical account of complexity versus universality. It seems sustainable to equate universal systems to complex…
This paper has been withdrawn by the author due to it contains some errors. A corrected treatment is presented in further publications of the author.
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
The paper describes two general problems encountered in computational assignments at the introductory level. First, novice students often treat computer code as almost magic incantations, and like novices in many fields, have trouble…
Computational reproducibility is a growing problem that has been extensively studied among computational researchers and within the signal processing and machine learning research community. However, with the changing landscape of signal…
This paper has been withdrawn because it is a duplicate of [math/0609208].
Results of simulation studies evaluating the performance of statistical methods are often considered actionable and thus can have a major impact on the way empirical research is implemented. However, so far there is limited evidence about…
We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
Reproducibility is a fundamental requirement of the scientific process since it enables outcomes to be replicated and verified. Computational scientific experiments can benefit from improved reproducibility for many reasons, including…
Paper withdrawn, see math-ph/0505072
This paper has been withdrawn by Wenji Deng (e-mail: [email protected]) for further modification at Oct. 12, 1998. {PACS: 03.75.Fi, 05.30.Jp.64.60.-i, 32.80.Pj}
The quantum superposition principle is reconsidered based on adiabatic theorem of quantum mechanics, nonadiabatic dressed states and experimental evidence. The physical mechanism and physical properties of the quantum superposition are…