{"title":"Computational Complexity And Phase Transitions","authors":"P. Cheeseman, B. Kanefsky, W. M. Taylor","doi":"10.1109/PHYCMP.1992.615495","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615495","url":null,"abstract":"It is well known that for many NP-complete problems, such as I<-Sat, I<-colorability etc., typical cases are easy to solve; so that coniputationally hard cases must be rare (assuming P # NP). This paper shows that NP-complete problems can be summarized by at least one “order parameter”, and that the hard problems occur at a critical value of such a parameter. This critical value separates two regions of characteristically different properties. For example, for K-colorability, the critical value separates overconstrained from underconstrained random graphs, and it marks the value at which the probability of a solution changes abruptly from near 0 to near 1. It is the high density of well-separated almost solutions (local minima) at this boundary that cause search algorithms to “thrash”. This boundary is a type of phase transition and we show that it is preserved under mappings between problems. We show that for some P problems either there is no phase transition or it occurs for bounded N (and so bounds the cost). These results suggest a way of deciding if a problem is in P or NP and why they are different.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126595681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computation And Quantum Superposition","authors":"R. Jozsa","doi":"10.1109/PHYCMP.1992.615537","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615537","url":null,"abstract":"We review recent work and some new results on the role of quantum superpositions in providing new modes of computation, not available to classical computers. For certain problems, these new modes can provide an exponential reduction in complexity over any classical computer demonstrating the importance of quantum processes for issues in complexity theory.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125558531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Energy Content Of Knowledge","authors":"T.W. Lynch","doi":"10.1109/PHYCMP.1992.615499","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615499","url":null,"abstract":"This paper explores the implications of a Maxwell’s demon successfully applying a priori knowledge about the motion of particles to a thermodynamic system. The assumption that the knowledge can be recorded symbolically is used to calculate the number of bits required to represent the knowledge needed for placing particles of a gas into a maximum work configuratzon. The amount of work is divided by the number of knowledge encoding bits to derive the average work potential per bit. The quantum mechanics correspondence principle and a conservation of energy analysis are used to argue that each knowledge bit must represent a quantity of energy, and the sum total of the knowledge energy is the quantity of work done by the system.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"301 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114103483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reversible Agents Need Robots Waste Bits To See, Talk, And Achieve?","authors":"Robin Hanson","doi":"10.1109/PHYCMP.1992.615558","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615558","url":null,"abstract":"A computer's task is often taken to be that of starting with some input, grinding for a while, and eventually returning an output. Remarkably, all such tasks can be accomplished \"reversibly\", with an arbitrarily low intrinsic entropy cost, and in reasonable space and time relative to irreversible approaches. Art@cial intelligence computation, however, does not fit well into an input-grind-output format. \"Reversible agents\" should run indefinitely, observing their world, acting to achieve goals, and talking with other autonomous agents. Do these additional requirements introduce more intrinsic entropy costs for such agents? This preliminary survey suggests that they do. Goal states can unavoidably have lower entropy than initial states. Sensing costs, when features of the world relevant to an agent's analysis change unpredictably before the agent has time to reverse that analysis. On the other hand, talk between nearby agents can be cheap.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117328292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Storage And Retrieval Of Quantum Information","authors":"A. Peres","doi":"10.1109/PHYCMP.1992.615515","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615515","url":null,"abstract":"Information encoded in non-orthogonal quantum states cannot be duplicated, nor amplified, and in general at is only partly recoverable. The most efficient way of retrieving it is not a direct uquantum measurement” (as defined by von Neumann), but an indirect method similar to heterodyne detection in communications engineering. The mathematical representation of this process requires the introduction of a positive operator valued measure. The optimization of these measures is not yet fully undersiood. An interesting and potentially important application of quantum information is its use an cryptography.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115530866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Aspects Of Computability In Physics","authors":"Joseph C. Shipman","doi":"10.1109/PHYCMP.1992.615561","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615561","url":null,"abstract":"This paper reviews connections between physics and computation, and explores their implications. The main topics are computational \"hardness\" of physical systems, computational status of fundamental theories, quantum computation, and the Universe as a computer.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128665047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cryptographic Primitives And Quantum Theory","authors":"C. Crépeau","doi":"10.1109/PHYCMP.1992.615540","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615540","url":null,"abstract":"only using public key cryptography, but using quantum mechanics as a support. This paper summarizes the current knowledge in the field of two-party cryptographic protocols devised f rom quantum systems. W e introduce the reader to the notion of cryptographic protocols and describe a number of sample building blocks to achieve them. W e also give pointers for the reader who i s interested to the quantum implementation of these building blocks. 2 Cryptographic Primitives We now introduce the main two basic primitives that have been widely considered as useful building blocks in the design of more elaborate cryptographic protocols:","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"50 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114027735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Function Optimization Based On Advanced Simulated Annealing","authors":"B. Rosen","doi":"10.1109/PHYCMP.1992.615559","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615559","url":null,"abstract":"Solutions to numerical problems often involve finding (or fitting) a set of parameters to optimize a function. A novel extension of the Simulated Annealing method, Very Fast Simulated Reannealing (VFSR) [6, 13, 81, has been proposed for optimizing difficult functions. VFSR has an exponentially decreasing temperature reduction schedule which is faster than both Boltzmn Annealing and Fast (Cauchy) Annealing. VFSR is shown to be is superior to these two methods on optimizing a difficult multimodal function.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121714592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Paradoxes And The Distribution Of Probabilities","authors":"K. DePryck","doi":"10.1109/PHYCMP.1992.615557","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615557","url":null,"abstract":"Within a classical logical environment, the occurrence of -A while A is the case, threatens the functioning of the whole system. In this paper, I argue that Tarski’s solution to paradoxes, me fa-levels, and Godel’s incompleteness theorem can be brought together as constitutive elements of a generative system. In this general system, a new level of complexity is created each time the existing levels cannot deal with a paradox on the highest level of the system. In this context, the increasing complexity of the world appears as a solution to paradoxality. Furthermore, I suggest that the jump from one level of complexity to the next can be understood as the reassignment of probabilities. Low-probability events causing a paradox will be assigned a higher probability on the next level. As a result, the organisation of that higher level will pay much more attention to the potential trouble.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123088659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Linguistic Mechanism, Physical Mechanism, And Secondary Non-r.e.ness Of The Physical World","authors":"A. Manaster-Ramer, Qiuen Yu","doi":"10.1109/PHYCMP.1992.615485","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615485","url":null,"abstract":"Starting from linguistics and ending up with physics, this paper develops the idea of distinguishing between primary non-r.e.ness and secondary nonr.e.ness for physics, linguistics, logic of mind, and cognitive science in general. Briefly, a natural language is primarily non-r.e. (non-recursively enumerable) if (Ll) it obeys certain non-r.e. rules; (L2) the human species can effectively command these non-r.e. rules; and (L$) only primarily non-r.e. intelligent species can effectively command these non-r. e. rules. By contrast, a natural language is secondarily nonr.e. if (Ll) holds regardless of (L2) and (L3). In a way of parallel, the physical world is primarily nonr.e. if there is a sub-system S of the physical world and a non-r.e. rule R such that (Pl) for any intelligent species (observer) there is no evidence against the assumption that S has R as one of its own laws; (PZ) there is an intelligent species which can effectively communicate with S concerning R (receiving information from S concerning the execution of RI following R, elc); and (P.9) any intelligent species satisfying (P2) is itself primarily non-r.e.. By contrast, ihe physical world is secondarily non-r.e. if (Pl) holds regardless of (P2) and (P3). This paper argues that the physical world and the conceptual world can be secondarily non-r.e. only, in spite of all the apparent counterevidence. That is, only (Pl) holds, while (P2) and (PS) both fail. Three major target references are made of J. Hintikka[2], N. Chomsky[l], and Penrose[5].","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"598 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122599703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}