{"title":"Computational Biosequence Analysis By Neural Networks","authors":"S. Brunak, J. Engelbrecht","doi":"10.1109/PHYCMP.1992.615505","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615505","url":null,"abstract":"The use of ariificial neural networks for biological sequence analysis has ncenily been strongly intensified. This paper describes work on ihe dificuli coding/noncoding classification problem in human DNA - an important step in the informaiion processing of the living cell. The network approach was utilized noi only for gccnemlizaiion purposes, but also aa 5 tool for obiain;rag knowledge aboui previously unknown local features of the DNA sequence.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"14 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":"114505089","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":"An Electroid Switching Model For Reversible Computer Architectures","authors":"J. S. Hall","doi":"10.1109/PHYCMP.1992.615549","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615549","url":null,"abstract":"The study of logical reversibiiity in computation has led to a proliferation of unconventional architectural proposals, from Brownian-motion clockwork Turing machines to billiardball Computers. An architectural model for reversible computers is proposed herein, that is significantly closer to the switch-level models used in designing actual digital circuitry. This ue'electroid (electronics-like) model facilitates the direct application of the substantial body of ezisting digital design techniques to reversible and dissipation-limited architectures.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"58 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":"121971562","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":"Information In Dynamics","authors":"Neil Gershenfeld","doi":"10.1109/PHYCMP.1992.615556","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615556","url":null,"abstract":"The historical search for the fundamental meaning of thermodynamic entropy lead to the discovery of the connection between entropy and information about microscopic dynamics, which in turn motivated the development of the theory of information in communications. In this paper I will review how information theory can profitably be applied back to its roots in dynamics in order to characterize the essential properties of a measured time series. Entropy was introduced in the familiar modern form (dS = SQ/T) by Clausius in 1854, building on work by Carnot (1824) and Kelvin (-1850) to understand the nature of heat and irreversability in thermodynamic systems.'I2 Boltzmann was dedicated to understanding the microscopic meaning of this macroscopic entropy; influenced by Maxwell's kinetic theory of gases (-1860) he introduced the relationship H = f(r,p,t)log f(r,p,t)d3rd3p (where f is the velocity distribution in a gas) in 1872, and then the more general form S = k log W (where W is the number of available states) around 1877. In 1871 Maxwell created his dem~n,~ which appeared to violate the second law of thermodynamics by intelligent action. Szilard, in 1929, made the significant step of considering a one-molecule gas that could be on either side of a partition; this introducing the idea of a binary bit of information (which side of the partition the molecule is in) and of using entropy to measure inf~rmation.~ Although Sxilard missed the crucial role of erase in explaining the demon's (mis)behavior (this was first recognized by Landauer5), he had laid the foundation for the development of both reversible computation6 and of information the~ry.~ In 1948 Shannon applied entropy to measure the information content in an arbitrary message, independent of its physical origin, and was thereby able to solve significant outstanding communications problems such as the maximum rate at which a message can be sent through a channel. Information theory has since flourished in engineering practice.8 The study of ergodic systems has both benefited from, and contributed to, information the~ry.~ More recently, Shaw pointed out the connection between information and dissipative dynamics,\" and Fraser extended this to develop a framework that I will describe here for characterizing the structure in time series produced by non-linear systems.l' Although a dynamical system's global structure can perform nontrivial computations,12i13 analyzing the information evolution associated with the much simpler local behavior is sufficient to answer deep questions about the complexity and predictability of a system. In this paper I will will explain how to understand and measure such information. As well as being quite useful in practice, this application of information theory back to its roots in dynamics provides a simple but clear example of the physical meaning of inf~rniation.'~ Assume that a physical system is described by a state vector 5 and governing equations d21dt = f (5) (o","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":"123633402","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":"Information In Direct And Indirect Quantum Measurements","authors":"L. Levitin","doi":"10.1109/PHYCMP.1992.615544","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615544","url":null,"abstract":"Lev B. Levitin Boston University, Boston, USA The information mciency of direct and indirect (generalized) quantum measurements is analyzed. The longstanding controversial problem, whether indirect measurements can yield more information than direct ones, is solved. I t is shown that for any quantum system described by an injinite-dimenswnal separable Hilbert space, the ir$ormations attainable by direct and indirect measurements are exactly equal. The quantum-mechanical generalization of Shannon's measure of information introduced in [ 121 is based on \"classical\" J. von Neumann's model of quantum measurements. Such measurements are called \"direct,\" since it is assumed that the measuring instrument (classically described) is applied directly to the system whose state we would like to identify (the system that carries information). However, the concept of quantum measurements can be extended by introducing indirect measurements which involve an additional quantum system coupled to the information carrier. Consider a quantum system with an ensemble of macmstates S = (si, pi}, each macrostate q being described by a density matrix ;(')in a Hilbert space H1. Consider an auxilliary quantum system (called in [3] \"ancilla\") whose state is independent of the state of the system carrying information and described by a density operator i ( O ) in a separable Hilbert space 4. Then the state of the compound system consisting of the two systems together is described by a tensor-product density operator $6) = ,j(i) ~b ~ ( 0 ) in the tensor-product Hilbert space H = HI 60 H2 Denote also i A complete indirect (generalized) measurement performed over the compound system and associated with a certain orthogonal basis K in the space H. Definition 1. Information about the macrostate S of the quantum system for a given state of the ancilia in the outcome of an indirect measurement associated with a basis K in the space HI 63 H2 is the quantity","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"115 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":"124034561","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":"What Are Nature's \"natural\" Ways Of Computing?","authors":"T. Toffoli","doi":"10.1109/PHYCMP.1992.615480","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615480","url":null,"abstract":"Today’s circuit elements are built out of physical materials, effectively characterized by macroscopic properties. To maintain the current rate ofprogress in miniaturization, we’ll eventually have to design compu ting elements based directly on microscopic physical effects. ln order best to exploit Nature’s potential for computation, we’ll have to ask a lot of questions before starting to give orders. What are Nature’s predispositions when it comes to computing? What types of computational processes are more naturally and directly supported by physics? What classes of computing tasks stand favored by Nature’s predispositions?","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"57 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":"132099485","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":"A Bridge Of Bits","authors":"N. Margolus","doi":"10.1109/PHYCMP.1992.615551","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615551","url":null,"abstract":"Cellular Automata are discrete physics-like systems that can be exactly simulated by digital hardware. These systems can incorporate many realistic physical constraints and still be capable of performing digital computation. Such systems bridge the boundary between physical models and computational models, and so can play a central role in investigating the relevance of physical ideas to the theory and practice of computation, and computational ideas to the construction and use of physical models.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"207 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":"114560300","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":"Natural Versus \"universal\" Probability, Complexity, And Entropy","authors":"J. Denker, Yann LeCun","doi":"10.1109/PHYCMP.1992.615508","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615508","url":null,"abstract":"The interrelated concepts of information. entropy, probability, aiid universal coniyutaliou eiijoy w r y wide applicatioii. I t is wvrth iroting, tliutcgh, t l t d the successful applications and theorems are inostly restricted to systeiits lcaviirg a zwst riuinler of par*licles or syinbols. For smal ler sys tems, it i s not clear how i o quanliffy th.e infom~atioii./eiitropy/probabtlziy precisely. W e uiyue that these are trot jusl. acigue, (icadt nric qtre.si.iotia, b-ut svirset irines (befits it e p 1.0 hlcnrs a I & praciice. Malheiiraiics and computer science al1o.w u s lo coiistrucd nisy nrriinher of itiequitrnlend probability n t m sure.q. E v e s ‘90-called “unii~er.sal” prohability niwnsiires can be quite iiiequivaleiit. Deciding tuhicli of these best deacribea the red world ia a t m k for enrpirical . w i t w e . As illuatratioiss uie coiisider the (1) itijorniation coiit ea l of the genome and (,?) a practical “lcariiing front ezamplcs ” task. Additional kcywords: ITniversal Turing Afnch,ine, Uti iversnl Data (?oiicpressivri., Viiive w a l P i i o r, A 1goiiih.iiric Complexity, Iiolrnogorotr Complexity, Macliiiie Leariiiirg.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"35 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":"128218844","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":"Galois Spinor Fields: A Home for All Computer Calculations?","authors":"I. R. Jackson","doi":"10.1109/PHYCMP.1992.615514","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615514","url":null,"abstract":"l\"hispaper introduces the idea of a new and novel mathematical object, the Spinor Extension G&is Reld This object is conjectured to be of value in the &compoaSition of algorithms for a MIMD processor.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"111 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":"126668179","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":"Oracle Quantum Computing","authors":"A. Berthiaume, G. Brassard","doi":"10.1109/PHYCMP.1992.615538","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615538","url":null,"abstract":"Abstract Building on the work of Deutsch and Jozsa, we construct oracles relative to which (1) there is a decision problem that can be solved with certainty in worst-case polynomial time on the quantum computer, yet it cannot be solved classically in probabilistic expected polynomial time if errors are not tolerated, nor even in nondeterministic polynomial time, and (2) there is a decision problem that can be solved in exponential time on the quantum computer, which requires double exponential time on all but finitely many instances on any classical deterministic computer.","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"1 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":"128968397","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":"Towards Practical Reversible Logic","authors":"R. Merkle","doi":"10.1109/PHYCMP.1992.615546","DOIUrl":"https://doi.org/10.1109/PHYCMP.1992.615546","url":null,"abstract":"There is now a fairly extensive literature on reversible computation[l, 2,3,4] which shows that the energy dissipation per device operation cannot be reduced below ln(2) kT (where k is Boltzman’s constant and T is the temperature) if the device is not reversible. For the last 50 years the energy dissipation per gate operation has been declining with remarkable regularity[5]. Extrapolation of this trend shows the energy dissipation per device operation reaching kT (for T = 300 K) by the year 2015. To gain some perspective on this consider that an “AND” gate which has a power supply of one volt and which allows a single electron to go from that one volt supply to ground during the course of a switching operation will dissipate one electron volt. Although one electron volt is about forty times kT (and well above the theoretical limit), it will be difficult to reach even this level of energy dissipation. Extrapolating present trends, we should reach forty kT between the year 2000 and 2010, e.g., within ten to twenty years. Computers in the 21st century are expected to have a very large number of logic devices[6]. Even if we only dissipate kT per logic operation, a future computer operating at room temperature and at a frequency of one gigahertz which had 10” logic gates packed into a cubic centimeter would dissipate roughly four megawatts. The drive for ever greater computational power with ever more densely packed logic elements will eventually require that a single logic operation dissipate at least several orders of magnitude less than kT. One of three things will occur: (a) the historic rate of decreasing energy dissipation per device operation will slow or halt in the next one or two decades or (b) we will operate computers at lower temperatures or (c) we will pursue methods of computing that use reversible logic devices in a reversible way that can beat the kT barrier. The first option is quite unattractive. The heroic cooling methods used in the Cray 3 supercomputer to remove the heat generated by the computer’s operation suggest that failure to reduce energy dissipation per gate operation would be a major limiting factor in future computer performance. Further, although the raw cost of electrical power is not yet a major limitation, it would become so in the future if reductions in energy dissipation did not keep pace with advances in other areas. The second option will not reduce overall energy dissipation. If we operated future devices at 3 Kelvins we would reduce kT by a factor of 100 and so could reduce energy dissipation by a similar factor but for fundamental thermodynamic reasons the coefficient of performance of the refrigerator for the system can be at best 3W(300K 3K) = 0.01 [7l. Thus, the lower energy required per gate operation will be almost exactly balanced by the increased energy needed by the refrigerator. In many applications refrigeration is not a reasonable option. Lap top computers, embedded systems, various “smart” applia","PeriodicalId":426387,"journal":{"name":"Workshop on Physics and Computation","volume":"1 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":"114239057","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}