| http://dbpedia.org/ontology/abstract
|
La profondeur de Bennett (ou profondeur lo … La profondeur de Bennett (ou profondeur logique de Bennett) est une mesure de la complexité en informatique, créée par le physicien et logicien américain Charles H. Bennett. Elle vient en complément de la complexité de Kolmogorov : si celle-ci mesure la longueur du plus petit programme écrit pour créer une , la profondeur de Bennett mesure, en nombre de pas, le temps de calcul de ce programme. Comme son nom veut l'indiquer, cette mesure ajoute une seconde dimension à la théorie de la complexité ou, plus précisément, à la théorie algorithmique de l'information. Par exemple, une image entièrement blanche et une image entièrement aléatoire (en pixels noirs ou blancs) auront des valeurs de complexité de Kolmogorov très différentes (faible pour l'image blanche, forte pour l'image totalement aléatoire), mais auront toutes deux de faibles valeurs de profondeur de Bennett. faibles valeurs de profondeur de Bennett.
, 逻辑深度（英語：logical depth）是一种对事物复杂性的度量，由美国科学家于1988年提出。 事物的逻辑深度与其柯氏复杂度相关。柯氏复杂度也是一种对复杂性的度量，是指能够描述某一信息的最短程序的长度。而逻辑深度则是指运行该程序所需的时间步数，因而还与程序的计算复杂性有关。
, Lógica de profundidade é uma medida de com … Lógica de profundidade é uma medida de complexidade concebida por Charles H. Bennett, com base na complexidade computacional de um algoritmo que pode recriar uma determinada quantidade de informação. Ele difere do teste de Kolmogorov complexidade porque considera algoritmos com curto tempo de computação em vez de basear-se apenas em seu comprimento.ez de basear-se apenas em seu comprimento.
, Logical depth is a measure of complexity f … Logical depth is a measure of complexity for individual strings devised by Charles H. Bennett based on the computational complexity of an algorithm that can recreate a given piece of information. It differs from Kolmogorov complexity in that it considers the computation time of the algorithm with nearly minimal length, rather than the length of the minimal algorithm. Formally, in the context of some universal computer the logical depth of a string to significance level is given by the running time of the fastest program that produces and is no more than longer than the minimal program.more than longer than the minimal program.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://books.google.com/books%3Fid=Sd2wUijnE8MC&pg=PA481%7Cpage=481%7Ccontribution=Computability +
|
| http://dbpedia.org/ontology/wikiPageID
|
24827002
|
| http://dbpedia.org/ontology/wikiPageLength
|
1773
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
929175202
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Analysis_of_algorithms +
, http://dbpedia.org/resource/Computation_time +
, http://dbpedia.org/resource/Kolmogorov_complexity +
, http://dbpedia.org/resource/Category:Information_theory +
, http://dbpedia.org/resource/Sophistication_%28complexity_theory%29 +
, http://dbpedia.org/resource/String_%28computer_science%29 +
, http://dbpedia.org/resource/Charles_H._Bennett_%28computer_scientist%29 +
, http://dbpedia.org/resource/Effective_complexity +
, http://dbpedia.org/resource/Category:Computational_complexity_theory +
, http://dbpedia.org/resource/Complexity +
, http://dbpedia.org/resource/Self-dissimilarity +
, http://dbpedia.org/resource/Forecasting_complexity +
, http://dbpedia.org/resource/Category:Measures_of_complexity +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Comp-sci-theory-stub +
, http://dbpedia.org/resource/Template:Citation +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Measures_of_complexity +
, http://dbpedia.org/resource/Category:Information_theory +
, http://dbpedia.org/resource/Category:Computational_complexity_theory +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Measure +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Logical_depth?oldid=929175202&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Logical_depth +
|
| owl:sameAs |
http://zh.dbpedia.org/resource/%E9%80%BB%E8%BE%91%E6%B7%B1%E5%BA%A6 +
, http://dbpedia.org/resource/Logical_depth +
, http://rdf.freebase.com/ns/m.0805dgn +
, http://yago-knowledge.org/resource/Logical_depth +
, http://fr.dbpedia.org/resource/Profondeur_de_Bennett +
, http://pt.dbpedia.org/resource/Profundidade_l%C3%B3gica +
, http://www.wikidata.org/entity/Q3406901 +
, https://global.dbpedia.org/id/38wzU +
|
| rdf:type |
http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/WikicatMeasuresOfComplexity +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Action100037396 +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/Maneuver100168237 +
, http://dbpedia.org/class/yago/Choice100161243 +
, http://dbpedia.org/class/yago/Move100165942 +
, http://dbpedia.org/class/yago/Decision100162632 +
, http://dbpedia.org/class/yago/Act100030358 +
, http://dbpedia.org/class/yago/Measure100174412 +
, http://dbpedia.org/ontology/Software +
|
| rdfs:comment |
Lógica de profundidade é uma medida de com … Lógica de profundidade é uma medida de complexidade concebida por Charles H. Bennett, com base na complexidade computacional de um algoritmo que pode recriar uma determinada quantidade de informação. Ele difere do teste de Kolmogorov complexidade porque considera algoritmos com curto tempo de computação em vez de basear-se apenas em seu comprimento.ez de basear-se apenas em seu comprimento.
, Logical depth is a measure of complexity f … Logical depth is a measure of complexity for individual strings devised by Charles H. Bennett based on the computational complexity of an algorithm that can recreate a given piece of information. It differs from Kolmogorov complexity in that it considers the computation time of the algorithm with nearly minimal length, rather than the length of the minimal algorithm. Formally, in the context of some universal computer the logical depth of a string to significance level is given by the running time of the fastest program that produces and is no more than longer than the minimal program.more than longer than the minimal program.
, 逻辑深度（英語：logical depth）是一种对事物复杂性的度量，由美国科学家于1988年提出。 事物的逻辑深度与其柯氏复杂度相关。柯氏复杂度也是一种对复杂性的度量，是指能够描述某一信息的最短程序的长度。而逻辑深度则是指运行该程序所需的时间步数，因而还与程序的计算复杂性有关。
, La profondeur de Bennett (ou profondeur lo … La profondeur de Bennett (ou profondeur logique de Bennett) est une mesure de la complexité en informatique, créée par le physicien et logicien américain Charles H. Bennett. Elle vient en complément de la complexité de Kolmogorov : si celle-ci mesure la longueur du plus petit programme écrit pour créer une , la profondeur de Bennett mesure, en nombre de pas, le temps de calcul de ce programme.e pas, le temps de calcul de ce programme.
|
| rdfs:label |
Profundidade lógica
, Logical depth
, Profondeur de Bennett
, 逻辑深度
|
