Fundamental Physics and Computation: The Computer-Theoretic Framework

The central goal of this manuscript is to survey the relationships between fundamental physics and computer science. We begin by providing a short historical review of how different concepts of computer science have entered the field of fundamental physics, highlighting the claim that the universe is a computer. Following the review, we explain why computational concepts have been embraced to interpret and describe physical phenomena. We then discuss seven arguments against the claim that the universe is a computational system and show that those arguments are wrong because of a misunderstanding of the extension of the concept of computation. Afterwards, we address a proposal to solve Hempel’s dilemma using the computability theory but conclude that it is incorrect. After that, we discuss the relationship between the proposals that the universe is a computational system and that our minds are a simulation. Analysing these issues leads us to proposing a new physical principle, called the principle of computability, which claims that the universe is a computational system (not restricted to digital computers) and that computational power and the computational complexity hierarchy are two fundamental physical constants. On the basis of this new principle, a scientific paradigm emerges to develop fundamental theories of physics: the computer-theoretic framework (CTF). The CTF brings to light different ideas already implicit in the work of several researchers and provides a new view on the universe based on computer theoretic concepts that expands the current view. We address different issues regarding the development of fundamental theories of physics in the new paradigm. Additionally, we discuss how the CTF brings new perspectives to different issues, such as the unreasonable effectiveness of mathematics and the foundations of cognitive science.

A complexity hierarchy-based solution to the clausal subject puzzle in Turkish

This paper presents a novel analysis of subordinate clause structure in Turkish, focusing on subordinations formed by the following three suffixes: the infinitival -mA(K) with tenseless and (ir)realis usages, and -DIK/ -(y)ACAK with a (non)future temporal specification. We present a classification aligning each form on the Implicational Complementation Hierarchy (ICH) proposed in Wurmbrand and Lohninger (2020), which provides a solution for the subject puzzle observed with these clauses: only infinitival -mA(K) clauses with their (ir)realis use are compatible with being the subject of a transitive verb. We propose that (ir)realis infinitival clauses belong to the situation class in the ICH, and that this middle class is of the ideal semantic complexity and syntactic size for a clausal subject in Turkish.

A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms

We introduce a new equivalence on graphs, defined by its symmetry-breaking capability. We first present a framework for various backtracking search algorithms, in which the equivalence is used to prune the search tree. Subsequently, we define the equivalence and an optimization problem with the goal of finding an equivalence partition with the highest pruning potential. We also position the optimization problem into the computational-complexity hierarchy. In particular, we show that the verifier lies between P and NP -complete problems. Striving for a practical usability of the approach, we devise a heuristic method for general graphs and optimal algorithms for trees and cycles.

The role of inter- and intralingual factors and compendiums in acquisition of Swedish as a foreign language: the case of Finns learning definiteness and the use of articles

This study explores the acquisition of definiteness and article use in written Swedish by Finnish-speaking teenagers (n=67) during the three years in secondary school. The studied grammatical phenomena are problematic for all L2 learners of Swedish and are especially difficult for learners, such as Finns, whose L1 lacks expressive definiteness morphologically. The informants produce complex NPs already in their first narratives. The form of NPs poses significantly more problems than the choice of a correct form of definiteness. Hence, it is possible that previous knowledge in English helps informants in the choice of definiteness. The common nominator for problematic expressions is simplification, in both formal aspects and in the relation between form and meaning. Previous research in Sweden has made similar findings. The most central types of NPs build an acquisition explainable by a complexity hierarchy between the different types of NPs. The informants master best NPs without definiteness markers. Definite singulars containing an ending are significantly easier than indefinite singulars, the indefinite article of which is notoriously difficult for Finns learning Swedish as an L2. This acquisition order, however, profoundly differs from the traditional order of instruction of their compendiums.

Computational complexity of ecological and evolutionary spatial dynamics

There are deep, yet largely unexplored, connections between computer science and biology. Both disciplines examine how information proliferates in time and space. Central results in computer science describe the complexity of algorithms that solve certain classes of problems. An algorithm is deemed efficient if it can solve a problem in polynomial time, which means the running time of the algorithm is a polynomial function of the length of the input. There are classes of harder problems for which the fastest possible algorithm requires exponential time. Another criterion is the space requirement of the algorithm. There is a crucial distinction between algorithms that can find a solution, verify a solution, or list several distinct solutions in given time and space. The complexity hierarchy that is generated in this way is the foundation of theoretical computer science. Precise complexity results can be notoriously difficult. The famous question whether polynomial time equals nondeterministic polynomial time (i.e., P = NP) is one of the hardest open problems in computer science and all of mathematics. Here, we consider simple processes of ecological and evolutionary spatial dynamics. The basic question is: What is the probability that a new invader (or a new mutant) will take over a resident population? We derive precise complexity results for a variety of scenarios. We therefore show that some fundamental questions in this area cannot be answered by simple equations (assuming that P is not equal to NP).

Fault Diagnosis of Communication Equipment Based on Rough Set Theory

According to the communication equipment fault characteristics of complexity, hierarchy, relevance, delay and uncertainty, the method of extracting diagnosis rules based on rough set is presented in order to obtain diagnostic decision rules with good adaptability and maximum matching capabilities. This method can process a large amount of fault data and it can reduce both attribute and attribute value.4 evaluations are selected to evaluate the effectiveness and reasonableness of decision rules, and finally core value table of decision rules which has a certain ability to adapt. Example shows that this method can remove noise in fault diagnosis sample, reduce the computation and improve the efficiency of diagnosis effectively.

Human Rights Arrangement on Indonesian Law

Article 1 paragraph (3) of the Constitution of 1945 (UUD 1945) stated that Indonesia is a Rule of Law. One feature of the Rule of Law is the existence of human rights in the state administration. Indonesia, since independence on August 17, 1945 has asserted the defense of human rights as stated in the opening clause and in the torso of the 1945 Constitution Article 27-34. In the era of reform, on the Government of President Habibie, the President and the Parliament ratified the UN convention against torture and other cruel, inhuman, or degrading human dignity into Law number 5 of 1998. Then the MPR also publishes the statutes of MPR No. XVII/MPR/1998 on Human Rights, which was followed up with the appearance of Law No. 39 of 1999 on human rights. In accordance with the law in Indonesia based on the sort of Law No. 12 of 2011, the actual products that have been issued by the Government (the MPR, DPR and President) that follow up the substance of Human Rights in the Constitution with established Assembly and the law is already correct. But when the MPR then does the second amendment to the Constitution on August 18, 2000 by adding a special article chapters and contains about Human Rights (as mentioned in Chapter X-A section 28 A-J), have made the complexity hierarchy of law in Indonesia because it is not in accordance with the substance of article 7 of Law No. 12 of 2011. How To Cite: Sardol, S. (2014). Human Rights Arrangement on Indonesian Law. Rechtsidee, 1(1), 85-100. doi:http://dx.doi.org/10.21070/jihr.v1i1.105

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience For every positive integer k, we construct an explicit family of functions f : \0, 1\(n) -\textgreater \0, 1\ which has (k + 1) - party communication complexity O(k) under every partition of the input bits into k + 1 parts of equal size, and k-party communication complexity Omega (n/k(4)2(k)) under every partition of the input bits into k parts. This improves an earlier hierarchy theorem due to V. Grolmusz. Our construction relies on known explicit constructions for a famous open problem of K. Zarankiewicz, namely, to find the maximum number of edges in a graph on n vertices that does not contain K-s,K-t as a subgraph.

Weakened portfolio effect in a collapsed salmon population complex

Recent research has highlighted the importance of interpopulation diversity in fostering the stability of population complexes. Here we focus on California’s recently collapsed fall-run Chinook salmon ( Oncorhynchus tshawytscha ) and ask whether portfolio effect induced buffering is observed across the complexity hierarchy from individual populations to populations within a river basin (Sacramento, San Joaquin) to the entire Central Valley. Some buffering was observed when comparing the coefficient of variation in adult returns to a given river basin with its constituent populations but not when comparing returns to the entire Central Valley with its constituent basins because of disproportionately many fish returning to the Sacramento Basin. Moreover, we report that positive correlations in population dynamics between rivers were stronger in the last 25 years of the study compared with the first 25 years. Together, these results suggest evidence of only a weak portfolio effect that has deteriorated in recent years. Nonetheless, we also report that correlations between rivers decreased significantly with distance, suggesting that some biocomplexity remains. Our results suggest that the greatest potential for strengthening the portfolio effect would come through restoration of San Joaquin Basin populations, which at low abundance currently contribute little to the overall buffering capacity despite low cross-basin correlations.