跳到内容
Thermodynamics of computation and information distance 预览资料
关闭预览资料
正在查...

Thermodynamics of computation and information distance

著者: Charles H Bennett
出版商: Amsterdam, the Netherlands : Centrum voor Wiskunde en Informatica, [1993]
丛书: Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture, CS-R9341.
版本/格式:   Print book : 英语查看所有的版本和格式
数据库:WorldCat
提要:
Abstract: "Intuitively, the minimal information distance between x and y is the length of the shortest program for a universal computer to transform x into y and y into x. This measure will be shown to be, up to a logarithmic additive term, equal to the maximum of the conditional Kolmogorov complexities [formula]. Any reasonable distance to measure similarity of pictures should be an effectively approximable,
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

文件类型:
所有的著者/提供者: Charles H Bennett
OCLC号码: 31184844
注意: "June 1993."
描述: 15 pages ; 29 cm.
丛书名: Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture, CS-R9341.
责任: C.H. Bennett [and others].

摘要:

Abstract: "Intuitively, the minimal information distance between x and y is the length of the shortest program for a universal computer to transform x into y and y into x. This measure will be shown to be, up to a logarithmic additive term, equal to the maximum of the conditional Kolmogorov complexities [formula]. Any reasonable distance to measure similarity of pictures should be an effectively approximable, symmetric, positive function of x and y satisfying a reasonable normalization condition and obeying the triangle inequality. It turns out that E₁ is minimal up to an additive constant among all such distances. Hence it is a universal 'picture distance', which accounts for any effective similarity between pictures.

A third information distance, based on the idea that one should aim for dissipationless computations, and hence for reversible ones, is given by the length [formula] of the shortest reversible program that transforms x into y and y into x on a universal reversible computer. It is shown that also E₂ = E₁, up to a logarithmic additive term. It is remarkable that three so differently motivated definitions turn out to define one and the same notion.

Another information distance, E₃, is obtained by minimizing the total amount of information flowing in and out during a reversible computation in which the program is not retained, in other words the number of extra bits (apart from x) that must be irreversibly supplied at the beginning, plus the number of garbage bits (apart from y) that must be irreversibly erased at the end of the computation to obtain a 'clean' y. This distance is within a logarithmic additive term of the sum of the conditional complexities, [formula]. Finally, using the physical theory of reversible computation, the simple difference K(x) - K(y) is shown to be an appropriate (universal, antisymmetric, and transitive) measure of the amount of thermodynamic work required to transform string x into string y by the most efficient process."

评论

用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!

相似资料

相关主题:(1)

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


Primary Entity

<http://www.worldcat.org/oclc/31184844> # Thermodynamics of computation and information distance
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "31184844" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/ne> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/444227015#Place/amsterdam_the_netherlands> ; # Amsterdam, the Netherlands
    schema:about <http://id.worldcat.org/fast/988345> ; # Kolmogorov complexity
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/444227015#Person/bennett_charles_h> ; # Charles H. Bennett
    schema:datePublished "1993" ;
    schema:description "Abstract: "Intuitively, the minimal information distance between x and y is the length of the shortest program for a universal computer to transform x into y and y into x. This measure will be shown to be, up to a logarithmic additive term, equal to the maximum of the conditional Kolmogorov complexities [formula]. Any reasonable distance to measure similarity of pictures should be an effectively approximable, symmetric, positive function of x and y satisfying a reasonable normalization condition and obeying the triangle inequality. It turns out that E₁ is minimal up to an additive constant among all such distances. Hence it is a universal 'picture distance', which accounts for any effective similarity between pictures."@en ;
    schema:description "Another information distance, E₃, is obtained by minimizing the total amount of information flowing in and out during a reversible computation in which the program is not retained, in other words the number of extra bits (apart from x) that must be irreversibly supplied at the beginning, plus the number of garbage bits (apart from y) that must be irreversibly erased at the end of the computation to obtain a 'clean' y. This distance is within a logarithmic additive term of the sum of the conditional complexities, [formula]. Finally, using the physical theory of reversible computation, the simple difference K(x) - K(y) is shown to be an appropriate (universal, antisymmetric, and transitive) measure of the amount of thermodynamic work required to transform string x into string y by the most efficient process.""@en ;
    schema:description "A third information distance, based on the idea that one should aim for dissipationless computations, and hence for reversible ones, is given by the length [formula] of the shortest reversible program that transforms x into y and y into x on a universal reversible computer. It is shown that also E₂ = E₁, up to a logarithmic additive term. It is remarkable that three so differently motivated definitions turn out to define one and the same notion."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/444227015> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/444227015#Series/report_centrum_voor_wiskunde_en_informatica_amsterdam_netherlands_computer_science_dept_of_algorithmics_and_architecture> ; # Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture ;
    schema:isPartOf <http://worldcat.org/issn/0169-118X> ; # Report = Rapport / Centrum voor Wiskunde en Informatica. Computer Science/Dept. of Algorithmics and Architecture,
    schema:name "Thermodynamics of computation and information distance"@en ;
    schema:productID "31184844" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/31184844#PublicationEvent/amsterdam_the_netherlands_centrum_voor_wiskunde_en_informatica_1993> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/444227015#Agent/centrum_voor_wiskunde_en_informatica> ; # Centrum voor Wiskunde en Informatica
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/31184844> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/444227015#Agent/centrum_voor_wiskunde_en_informatica> # Centrum voor Wiskunde en Informatica
    a bgn:Agent ;
    schema:name "Centrum voor Wiskunde en Informatica" ;
    .

<http://experiment.worldcat.org/entity/work/data/444227015#Person/bennett_charles_h> # Charles H. Bennett
    a schema:Person ;
    schema:familyName "Bennett" ;
    schema:givenName "Charles H." ;
    schema:name "Charles H. Bennett" ;
    .

<http://experiment.worldcat.org/entity/work/data/444227015#Place/amsterdam_the_netherlands> # Amsterdam, the Netherlands
    a schema:Place ;
    schema:name "Amsterdam, the Netherlands" ;
    .

<http://experiment.worldcat.org/entity/work/data/444227015#Series/report_centrum_voor_wiskunde_en_informatica_amsterdam_netherlands_computer_science_dept_of_algorithmics_and_architecture> # Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/31184844> ; # Thermodynamics of computation and information distance
    schema:name "Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture ;" ;
    .

<http://id.worldcat.org/fast/988345> # Kolmogorov complexity
    a schema:Intangible ;
    schema:name "Kolmogorov complexity"@en ;
    .

<http://worldcat.org/issn/0169-118X> # Report = Rapport / Centrum voor Wiskunde en Informatica. Computer Science/Dept. of Algorithmics and Architecture,
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/31184844> ; # Thermodynamics of computation and information distance
    schema:issn "0169-118X" ;
    schema:name "Report = Rapport / Centrum voor Wiskunde en Informatica. Computer Science/Dept. of Algorithmics and Architecture," ;
    .


Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.