发布求助
文献互助 智能选刊 最新文献

Proceedings Workshop on Physics and Computation. PhysComp '94最新文献

筛选
英文 中文
Some results on invertible cellular automata 关于可逆元胞自动机的一些结果
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363688
A. Clementi, P. Mentrasti, P. Pierini
{"title":"Some results on invertible cellular automata","authors":"A. Clementi, P. Mentrasti, P. Pierini","doi":"10.1109/PHYCMP.1994.363688","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363688","url":null,"abstract":"Addresses certain questions concerning invertible cellular automata, and presents new results in this area. Specifically, we explicitly construct a cellular automaton in a class (a residual class) previously known not to be empty only via a nonconstructive existence proof. This class contains cellular automata that are invertible on every finite support but not on an infinite lattice. Moreover, we show a class that contains invertible cellular automata having bounded neighborhood, but whose inverses constitute a class of cellular automata for which there isn't any recursive function bounding all the neighborhood.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121308178","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}
引用次数: 3
Analog computation with continuous ODEs 连续ode的模拟计算
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363672
M. Branicky
{"title":"Analog computation with continuous ODEs","authors":"M. Branicky","doi":"10.1109/PHYCMP.1994.363672","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363672","url":null,"abstract":"Demonstrates simple, low-dimensional systems of ODEs that can simulate arbitrary finite automata, push-down automata, and Turing machines. We conclude that there are systems of ODEs in R/sup 3/ with continuous vector fields possessing the power of universal computation. Further, such computations can be made robust to small errors in coding of the input or measurement of the output. As such, they represent physically realizable computation. We make precise what we mean by \"simulation\" of digital machines by continuous dynamical systems. We also discuss elements that a more comprehensive ODE-based model of analog computation should contain. The \"axioms\" of such a model are based on considerations from physics.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124543420","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}
引用次数: 34
On physical models of neural computation and their analog VLSI implementation 神经计算的物理模型及其模拟VLSI实现
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363673
A. Andreou
{"title":"On physical models of neural computation and their analog VLSI implementation","authors":"A. Andreou","doi":"10.1109/PHYCMP.1994.363673","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363673","url":null,"abstract":"Examines computation in a framework where the problem is essentially that of extracting a signal from noise, filtering (selective amplification) or estimation. The discussion is relevant to computational tasks in sensory communication, such as vision, speech and natural language processing. We consider \"real\" systems, both natural (neural systems) and human engineered (silicon integrated circuits), where information processing takes the form of an irreversible physical process. We argue, and demonstrate experimentally, that it is possible to see the emergence of truly complex processing structures that are commensurate with the physical properties of the computational substrate and are therefore energetically efficient.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121027649","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}
引用次数: 13
On the average-case complexity of the reversibility problem for finite cellular automata 有限元胞自动机可逆性问题的平均情况复杂度
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363687
A. Clementi, P. Pierini, R. Impagliazzo
{"title":"On the average-case complexity of the reversibility problem for finite cellular automata","authors":"A. Clementi, P. Pierini, R. Impagliazzo","doi":"10.1109/PHYCMP.1994.363687","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363687","url":null,"abstract":"Of particular relevance in the theory and applications of cellular automata is the concept of invertibility. We study the computational complexity of deciding whether or not a given finite cellular automata is invertible. This problem is known to be CoNP-complete, we prove that the expected-time complexity of its randomized version is \"hard\": the problem is CoRNP-complete. Finally, we discuss some consequences of this result in the theory and applications of cellular automata.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125837499","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}
引用次数: 1
Bit-string physics: a novel "theory of everything" 位串物理学:一种新颖的“万有理论”
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363694
H. Noyes
{"title":"Bit-string physics: a novel \"theory of everything\"","authors":"H. Noyes","doi":"10.1109/PHYCMP.1994.363694","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363694","url":null,"abstract":"Encodes the quantum numbers of the standard model of quarks and leptons using constructed bit-strings of length 256. These label a growing universe of bit-strings of growing length that eventually construct a finite and discrete space-time with reasonable cosmological properties. Coupling constants and mass ratios, computed from closure under XOR and a statistical hypothesis, using only /spl planck/, c and m/sub p/ to fix our units of mass, length and time in terms of standard (meter-kilogram-second) metrology, agree with the first four to seven significant figures of accepted experimental results. Finite and discrete conservation laws and commutation relations insure the essential characteristics of relativistic quantum mechanics, including particle-antiparticle pair creation. The correspondence limit in (free space) Maxwell electromagnetism and Einstein gravitation is consistent with the Feynman-Dyson-Tanimura \"proof\".<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130925418","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}
引用次数: 15
Space, time, logic, and things 空间，时间，逻辑和事物
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363701
R. Shoup
{"title":"Space, time, logic, and things","authors":"R. Shoup","doi":"10.1109/PHYCMP.1994.363701","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363701","url":null,"abstract":"We examine the fundamental origins of logic and show how these fundamentals are related to basic concepts of space, time, objects, and events used in both physics and computing. We attempt to show how a universe can be constructed beginning not from first principles, but from no principles. Several possible implications for physics and mathematics are also discussed.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984513","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}
引用次数: 4
Quantum waveguide structures and devices 量子波导结构与器件
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363684
S. Goodnick, A. Weisshaar, A. Ecker, V. Tripathi
{"title":"Quantum waveguide structures and devices","authors":"S. Goodnick, A. Weisshaar, A. Ecker, V. Tripathi","doi":"10.1109/PHYCMP.1994.363684","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363684","url":null,"abstract":"Nanometer structures in semiconductor heterojunction systems have been studied for several years and have conclusively shown evidence for quantum interference phenomena and granular effects due to the finite number of electrons and impurities. Various proposals have been made for novel devices based on such effects, which would serve as the basis for terabit memories and ultra-dense processing elements. A discussion is given of the application of a generalized mode-matching scheme as a computational tool for investigating arbitrary quantum waveguide structures and discontinuities. Results are presented for the nonlinear conductance properties of multiple bend structures, lateral resonant tunnel structures, and nonequilibrium transport through quantum dot structures. Comparison is made to various experimental realizations of these structures where complications due to undesired inhomogeneities, such as boundary roughness and impurities, play a significant role.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124529416","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}
引用次数: 3
Research toward nanoelectronic computing technologies in Japan 日本纳米电子计算技术的研究
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363706
R. Kiehl
{"title":"Research toward nanoelectronic computing technologies in Japan","authors":"R. Kiehl","doi":"10.1109/PHYCMP.1994.363706","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363706","url":null,"abstract":"A perspective of the research activities in Japan aimed at the development of new computing technologies based on structures with ultra-small dimensions is presented. Examples are given of work toward the development of resonant tunneling circuits, electron-wave interference and single-electron tunneling devices, and atomic-scale fabrication technologies.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125928344","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}
引用次数: 1
The complexity and entropy of Turing machines 图灵机的复杂性和熵
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363677
P. Dufort, C. Lumsden
{"title":"The complexity and entropy of Turing machines","authors":"P. Dufort, C. Lumsden","doi":"10.1109/PHYCMP.1994.363677","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363677","url":null,"abstract":"Addresses the relationship between dynamical systems theory and theoretical computer science, in particular the dynamical, information-theoretic and computational properties of systems that compute. These properties have been studied in cellular automata and the symbolic dynamics of maps over the unit interval, but have never been addressed in compact systems known to be capable of universal computation. Recent work is described in which the entropy, periodicity and regular language complexity of a large number of randomly generated Turing machines were calculated. The results are discussed in detail and compared with an identical analysis of a universal Turing machine. This comparison yields the first direct quantitative evidence that universal computation lies between ordered and chaotic behavior. The discussion concludes with a list of questions remaining to be answered about the phase-space portrait of computationally complex systems.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882985","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}
引用次数: 8
Reversible logic issues in adiabatic CMOS 绝热CMOS中的可逆逻辑问题
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363692
W. Athas, L.J. Svensson
{"title":"Reversible logic issues in adiabatic CMOS","authors":"W. Athas, L.J. Svensson","doi":"10.1109/PHYCMP.1994.363692","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363692","url":null,"abstract":"Power dissipation in CMOS circuits has become increasingly important for the design of portable, embedded and high-performance computing systems. Our VLSI research group has investigated a novel form of energy-conserving logic suitable for CMOS. Through small chip-building experiments, we have demonstrated the low-power operation of simple logic functions. These chips have used logical reversibility on a small, sometimes trivial, scale to achieve their low-power operation. In moving towards more complex functions, the role of reversibility will increase. This paper addresses two problem areas that we have found to be crucial to successfully realizing low-power operation of CMOS chips using reversible logic techniques. The first area is the energy-efficient design of the combined power supply and clock generator. The second is the logical overhead needed to support reversible logic functions. The first problem area, though formidable, seems amenable to systematic approaches. Significant inroads have been made towards finding practical, efficient solutions. The second, however, appears to be by far the more difficult hurdle to overcome irreversible logic is to become an attractive approach for reducing power dissipation in CMOS.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129114723","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}
引用次数: 90
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信