pular para conteúdo
Thermodynamics of computation and information distance Ver prévia deste item
FecharVer prévia deste item
Checando...

Thermodynamics of computation and information distance

Autor: Charles H Bennett
Editora: Amsterdam, the Netherlands : Centrum voor Wiskunde en Informatica, [1993]
Séries: Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture, CS-R9341.
Edição/Formato   Livro : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:
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,
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Charles H Bennett
Número OCLC: 31184844
Notas: "June 1993."
Descrição: 15 pages ; 29 cm.
Título da Série: Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture, CS-R9341.
Responsabilidade: C.H. Bennett [and others].

Resumo:

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."

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.

Ítens Similares

Assuntos Relacionados:(1)

Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<http://www.worldcat.org/oclc/31184844>
library:oclcnum"31184844"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/31184844>
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/988345>
rdf:typeschema:Intangible
schema:name"Kolmogorov complexity"@en
schema:name"Kolmogorov complexity."@en
schema:about
schema:contributor
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:name"Thermodynamics of computation and information distance"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.