. "Nella teoria della complessit\u00E0 computazionale, il Teorema dello speedup di Blum, proposto da Manuel Blum nel 1967, \u00E8 un importante teorema dello speedup riguardante la complessit\u00E0 delle funzioni calcolabili. Ogni funzione calcolabile ha un infinito numero di differenti rappresentazioni in un dato linguaggio di programmazione. Nella teoria della computabilit\u00E0 si ha spesso la necessit\u00E0 di trovare un algoritmo di minor complessit\u00E0 per una data funzione calcolabile e una data classe di complessit\u00E0. Il teorema dello speedup di Blum sostiene che per ogni classe di complessit\u00E0 esistono funzioni calcolabili per la cui elaborazione non esistono programmi pi\u00F9 efficienti (veloci)."@it . . "Na teoria da complexidade computacional, o teorema da acelera\u00E7\u00E3o de Blum ou teorema do aumento da velocidade de Blum (do ingl\u00EAs, Blum's speedup theorem), inicialmente definido por Manuel Blum em 1967, \u00E9 um teorema fundamental sobre a complexidade de fun\u00E7\u00F5es comput\u00E1veis."@pt . . . . . . "Blum's speedup theorem"@en . . . . . . . "\u30D6\u30E9\u30E0\u306E\u52A0\u901F\u5B9A\u7406\uFF08\u3076\u3089\u3080\u306E\u304B\u305D\u304F\u3066\u3044\u308A\u3001\u82F1: Blum's speedup theorem\uFF09\u306F\u8A08\u7B97\u8907\u96D1\u6027\u7406\u8AD6\u306B\u304A\u3051\u308B\u8A08\u7B97\u53EF\u80FD\u95A2\u6570\u306E\u8907\u96D1\u6027\u306B\u95A2\u3059\u308B\u57FA\u672C\u5B9A\u7406\u3067\u3042\u308A\u30011967\u5E74\u306B\u30DE\u30CC\u30A8\u30EB\u30FB\u30D6\u30E9\u30E0\u306B\u3088\u3063\u3066\u793A\u3055\u308C\u305F\u3002 \u8A08\u7B97\u53EF\u80FD\u95A2\u6570\u306F\u7121\u9650\u500B\u306E\u76F8\u7570\u306A\u308B\u30D7\u30ED\u30B0\u30E9\u30E0\u8868\u73FE\u3092\u6301\u3064\u3002\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306E\u7406\u8AD6\u306F\u305D\u306E\u3088\u3046\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u304B\u3089\u4E0E\u3048\u3089\u308C\u305F\u8907\u96D1\u6027\u6E2C\u5EA6\u306B\u5BFE\u3057\u3066\u6700\u5C0F\u3068\u306A\u308B\u30D7\u30ED\u30B0\u30E9\u30E0\uFF08\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\uFF09\u3092\u63A2\u308B\u3002\u30D6\u30E9\u30E0\u306E\u52A0\u901F\u5B9A\u7406\u306F\u3001\u3044\u304B\u306A\u308B\u8907\u96D1\u6027\u6E2C\u5EA6\u306B\u5BFE\u3057\u3066\u3082\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u5B58\u5728\u3057\u306A\u3044\u3088\u3046\u306A\u95A2\u6570\u304C\u8907\u96D1\u6027\u6E2C\u5EA6\u306B\u5FDC\u3058\u3066\u5B58\u5728\u3059\u308B\u3053\u3068\u3092\u8FF0\u3079\u308B\u3002\u3053\u308C\u306F\u307E\u305F\u4EFB\u610F\u306E\u95A2\u6570\u306B\u5BFE\u3057\u3066\u305D\u306E\u8A08\u7B97\u8907\u96D1\u6027\u3092\u5272\u308A\u5F53\u3066\u308B\u65B9\u6CD5\u3001\u3064\u307E\u308A\u4EFB\u610F\u306E\u95A2\u6570 f \u306B\u5BFE\u3057\u3066 f \u3092\u8868\u73FE\u3059\u308B\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u8907\u96D1\u6027\u3092\u5272\u308A\u5F53\u3066\u308B\u65B9\u6CD5\u304C\u5B58\u5728\u3057\u306A\u3044\u3053\u3068\u3092\u793A\u3057\u3066\u3044\u308B\u3002\u3053\u306E\u3053\u3068\u306F\u7279\u5B9A\u306E\u5177\u4F53\u7684\u306A\u95A2\u6570\u306B\u3064\u3044\u3066\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u8907\u96D1\u6027\u3092\u63A2\u3059\u3053\u3068\u304C\u3067\u304D\u306A\u3044\u3068\u3044\u3046\u3053\u3068\u3092\u610F\u5473\u3057\u306A\u3044\u3002"@ja . . "\u5728\u8A08\u7B97\u8907\u96DC\u6027\u7406\u8AD6\uFF0C\u5E03\u76E7\u59C6\u52A0\u901F\u5B9A\u7406\uFF08\u82F1\u8A9E\uFF1ABlum's speedup theorem\uFF09\u70BA\u95DC\u65BC\u53EF\u8BA1\u7B97\u51FD\u6570\u8907\u96DC\u5EA6\u7684\u57FA\u672C\u5B9A\u7406\uFF0C\u6700\u65E9\u7531\u66FC\u7EBD\u5C14\u00B7\u5E03\u5362\u59C6\u57281967\u5E74\u63D0\u51FA\u3002 \u9078\u5B9A\u4E00\u7A2E\u7DE8\u7A0B\u8A9E\u8A00\u5F8C\uFF0C\u6BCF\u500B\u53EF\u8A08\u7B97\u51FD\u6578\u4ECD\u7531\u7121\u7AAE\u591A\u500B\u7A0B\u5F0F\u5BE6\u73FE\uFF0C\u8A72\u4E9B\u7A0B\u5F0F\u53EF\u80FD\u5404\u6709\u512A\u52A3\u3002\u7D66\u5B9A\u67D0\u500B\u53EF\u8A08\u7B97\u51FD\u6578\u548C\u8907\u96DC\u5EA6\u8861\u91CF\u6642\uFF0C\u7B97\u6CD5\u7406\u8AD6\u7D93\u5E38\u5C0B\u627E\u8A08\u7B97\u8A72\u51FD\u6578\u300C\u6700\u4E0D\u8907\u96DC\u300D\u7684\u7B97\u6CD5\uFF08\u7A31\u70BA\u300C\u6700\u512A\u300D\uFF0C\u4F8B\u5982\u7576\u8907\u96DC\u5EA6\u7528\u6642\u9593\u8861\u91CF\u6642\uFF0C\u4FBF\u662F\u300C\u6700\u5FEB\u300D\uFF09\u3002\u5E03\u9B6F\u59C6\u52A0\u901F\u5B9A\u7406\u65B7\u8A00\uFF0C\u4EFB\u4F55\u8907\u96DC\u5EA6\u8861\u91CF\u4E0B\uFF0C\u90FD\u5B58\u5728\u67D0\u500B\u6CA1\u6709\u6700\u512A\u7B97\u6CD5\u7684\u53EF\u8A08\u7B97\u51FD\u6578\uFF0C\u4EA6\u5373\uFF0C\u4EFB\u4F55\u8A72\u51FD\u6578\u7684\u7A0B\u5F0F\u5BE6\u73FE\u90FD\u6703\u6BD4\u53E6\u4E00\u500B\u5BE6\u73FE\u8907\u96DC\u3002\u6B64\u7D50\u8AD6\u540C\u6642\u8AAA\u660E\uFF0C\u7121\u6CD5\u540C\u6642\u5B9A\u7FA9\u5168\u90E8\u53EF\u8A08\u7B97\u51FD\u6578\u7684\u8907\u96DC\u5EA6\uFF08\u51FD\u6578\u7684\u8907\u96DC\u5EA6\u662F\u5176\u6700\u512A\u7A0B\u5F0F\u7684\u8907\u96DC\u5EA6\uFF09\u3002\u7576\u7136\uFF0C\u4E0D\u6392\u9664\u80FD\u627E\u5230\u7279\u5B9A\u51FD\u6578\u7684\u6700\u512A\u7A0B\u5F0F\uFF0C\u4E26\u8A08\u7B97\u5176\u8907\u96DC\u5EA6\u3002"@zh . . "BlumsSpeed-UpTheorem"@en . . "Teorema da acelera\u00E7\u00E3o de Blum"@pt . "\u30D6\u30E9\u30E0\u306E\u52A0\u901F\u5B9A\u7406\uFF08\u3076\u3089\u3080\u306E\u304B\u305D\u304F\u3066\u3044\u308A\u3001\u82F1: Blum's speedup theorem\uFF09\u306F\u8A08\u7B97\u8907\u96D1\u6027\u7406\u8AD6\u306B\u304A\u3051\u308B\u8A08\u7B97\u53EF\u80FD\u95A2\u6570\u306E\u8907\u96D1\u6027\u306B\u95A2\u3059\u308B\u57FA\u672C\u5B9A\u7406\u3067\u3042\u308A\u30011967\u5E74\u306B\u30DE\u30CC\u30A8\u30EB\u30FB\u30D6\u30E9\u30E0\u306B\u3088\u3063\u3066\u793A\u3055\u308C\u305F\u3002 \u8A08\u7B97\u53EF\u80FD\u95A2\u6570\u306F\u7121\u9650\u500B\u306E\u76F8\u7570\u306A\u308B\u30D7\u30ED\u30B0\u30E9\u30E0\u8868\u73FE\u3092\u6301\u3064\u3002\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306E\u7406\u8AD6\u306F\u305D\u306E\u3088\u3046\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u304B\u3089\u4E0E\u3048\u3089\u308C\u305F\u8907\u96D1\u6027\u6E2C\u5EA6\u306B\u5BFE\u3057\u3066\u6700\u5C0F\u3068\u306A\u308B\u30D7\u30ED\u30B0\u30E9\u30E0\uFF08\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\uFF09\u3092\u63A2\u308B\u3002\u30D6\u30E9\u30E0\u306E\u52A0\u901F\u5B9A\u7406\u306F\u3001\u3044\u304B\u306A\u308B\u8907\u96D1\u6027\u6E2C\u5EA6\u306B\u5BFE\u3057\u3066\u3082\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u5B58\u5728\u3057\u306A\u3044\u3088\u3046\u306A\u95A2\u6570\u304C\u8907\u96D1\u6027\u6E2C\u5EA6\u306B\u5FDC\u3058\u3066\u5B58\u5728\u3059\u308B\u3053\u3068\u3092\u8FF0\u3079\u308B\u3002\u3053\u308C\u306F\u307E\u305F\u4EFB\u610F\u306E\u95A2\u6570\u306B\u5BFE\u3057\u3066\u305D\u306E\u8A08\u7B97\u8907\u96D1\u6027\u3092\u5272\u308A\u5F53\u3066\u308B\u65B9\u6CD5\u3001\u3064\u307E\u308A\u4EFB\u610F\u306E\u95A2\u6570 f \u306B\u5BFE\u3057\u3066 f \u3092\u8868\u73FE\u3059\u308B\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u8907\u96D1\u6027\u3092\u5272\u308A\u5F53\u3066\u308B\u65B9\u6CD5\u304C\u5B58\u5728\u3057\u306A\u3044\u3053\u3068\u3092\u793A\u3057\u3066\u3044\u308B\u3002\u3053\u306E\u3053\u3068\u306F\u7279\u5B9A\u306E\u5177\u4F53\u7684\u306A\u95A2\u6570\u306B\u3064\u3044\u3066\u6700\u9069\u306A\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u8907\u96D1\u6027\u3092\u63A2\u3059\u3053\u3068\u304C\u3067\u304D\u306A\u3044\u3068\u3044\u3046\u3053\u3068\u3092\u610F\u5473\u3057\u306A\u3044\u3002"@ja . "Teorema del aumento de velocidad de Blum"@es . . . . . . . "En Teor\u00EDa de la complejidad computacional el teorema del aumento de velocidad de Blum, dado primero por Manuel Blum en 1967, es un teorema importante sobre la complejidad de funciones computables. Cada funci\u00F3n computable tiene un n\u00FAmero infinito de representaciones en cierto lenguaje de programaci\u00F3n. En la , uno suele tener que encontrar el programa con la menor complejidad por una funci\u00F3n computable dada y una medida de complejidad. El teorema del aumento de velocidad de Blum dice que por cualquier medida de complejidad hay funciones computables que no tienen un programa m\u00EDnimo."@es . . "\u30D6\u30E9\u30E0\u306E\u52A0\u901F\u5B9A\u7406"@ja . . "In computational complexity theory, Blum's speedup theorem, first stated by Manuel Blum in 1967, is a fundamental theorem about the complexity of computable functions. Each computable function has an infinite number of different program representations in a given programming language. In the theory of algorithms one often strives to find a program with the smallest complexity for a given computable function and a given complexity measure (such a program could be called optimal). Blum's speedup theorem shows that for any complexity measure, there exists a computable function, such that there is no optimal program computing it, because every program has a program of lower complexity. This also rules out the idea there is a way to assign to arbitrary functions their computational complexity, meaning the assignment to any f of the complexity of an optimal program for f. This does of course not exclude the possibility of finding the complexity of an optimal program for certain specific functions."@en . . . "In computational complexity theory, Blum's speedup theorem, first stated by Manuel Blum in 1967, is a fundamental theorem about the complexity of computable functions. Each computable function has an infinite number of different program representations in a given programming language. In the theory of algorithms one often strives to find a program with the smallest complexity for a given computable function and a given complexity measure (such a program could be called optimal). Blum's speedup theorem shows that for any complexity measure, there exists a computable function, such that there is no optimal program computing it, because every program has a program of lower complexity. This also rules out the idea there is a way to assign to arbitrary functions their computational complexity, "@en . . . "\u5E03\u76E7\u59C6\u52A0\u901F\u5B9A\u7406"@zh . . . . . "1112970923"^^ . "2757528"^^ . . "\u5728\u8A08\u7B97\u8907\u96DC\u6027\u7406\u8AD6\uFF0C\u5E03\u76E7\u59C6\u52A0\u901F\u5B9A\u7406\uFF08\u82F1\u8A9E\uFF1ABlum's speedup theorem\uFF09\u70BA\u95DC\u65BC\u53EF\u8BA1\u7B97\u51FD\u6570\u8907\u96DC\u5EA6\u7684\u57FA\u672C\u5B9A\u7406\uFF0C\u6700\u65E9\u7531\u66FC\u7EBD\u5C14\u00B7\u5E03\u5362\u59C6\u57281967\u5E74\u63D0\u51FA\u3002 \u9078\u5B9A\u4E00\u7A2E\u7DE8\u7A0B\u8A9E\u8A00\u5F8C\uFF0C\u6BCF\u500B\u53EF\u8A08\u7B97\u51FD\u6578\u4ECD\u7531\u7121\u7AAE\u591A\u500B\u7A0B\u5F0F\u5BE6\u73FE\uFF0C\u8A72\u4E9B\u7A0B\u5F0F\u53EF\u80FD\u5404\u6709\u512A\u52A3\u3002\u7D66\u5B9A\u67D0\u500B\u53EF\u8A08\u7B97\u51FD\u6578\u548C\u8907\u96DC\u5EA6\u8861\u91CF\u6642\uFF0C\u7B97\u6CD5\u7406\u8AD6\u7D93\u5E38\u5C0B\u627E\u8A08\u7B97\u8A72\u51FD\u6578\u300C\u6700\u4E0D\u8907\u96DC\u300D\u7684\u7B97\u6CD5\uFF08\u7A31\u70BA\u300C\u6700\u512A\u300D\uFF0C\u4F8B\u5982\u7576\u8907\u96DC\u5EA6\u7528\u6642\u9593\u8861\u91CF\u6642\uFF0C\u4FBF\u662F\u300C\u6700\u5FEB\u300D\uFF09\u3002\u5E03\u9B6F\u59C6\u52A0\u901F\u5B9A\u7406\u65B7\u8A00\uFF0C\u4EFB\u4F55\u8907\u96DC\u5EA6\u8861\u91CF\u4E0B\uFF0C\u90FD\u5B58\u5728\u67D0\u500B\u6CA1\u6709\u6700\u512A\u7B97\u6CD5\u7684\u53EF\u8A08\u7B97\u51FD\u6578\uFF0C\u4EA6\u5373\uFF0C\u4EFB\u4F55\u8A72\u51FD\u6578\u7684\u7A0B\u5F0F\u5BE6\u73FE\u90FD\u6703\u6BD4\u53E6\u4E00\u500B\u5BE6\u73FE\u8907\u96DC\u3002\u6B64\u7D50\u8AD6\u540C\u6642\u8AAA\u660E\uFF0C\u7121\u6CD5\u540C\u6642\u5B9A\u7FA9\u5168\u90E8\u53EF\u8A08\u7B97\u51FD\u6578\u7684\u8907\u96DC\u5EA6\uFF08\u51FD\u6578\u7684\u8907\u96DC\u5EA6\u662F\u5176\u6700\u512A\u7A0B\u5F0F\u7684\u8907\u96DC\u5EA6\uFF09\u3002\u7576\u7136\uFF0C\u4E0D\u6392\u9664\u80FD\u627E\u5230\u7279\u5B9A\u51FD\u6578\u7684\u6700\u512A\u7A0B\u5F0F\uFF0C\u4E26\u8A08\u7B97\u5176\u8907\u96DC\u5EA6\u3002"@zh . . . "Blum's Speed-Up Theorem"@en . "3054"^^ . "Na teoria da complexidade computacional, o teorema da acelera\u00E7\u00E3o de Blum ou teorema do aumento da velocidade de Blum (do ingl\u00EAs, Blum's speedup theorem), inicialmente definido por Manuel Blum em 1967, \u00E9 um teorema fundamental sobre a complexidade de fun\u00E7\u00F5es comput\u00E1veis. Cada fun\u00E7\u00E3o comput\u00E1vel possui um n\u00FAmero infinito de representa\u00E7\u00F5es em programas diferentes em uma dada linguagem de programa\u00E7\u00E3o. Na teoria dos algoritmos, muitas vezes procura-se encontrar um programa com a menor complexidade para uma dada fun\u00E7\u00E3o comput\u00E1vel e uma medida de complexidade (tal programa poderia se denominar \u00F3timo). O teorema da acelera\u00E7\u00E3o de Blum mostra que, para qualquer medida de complexidade, existem fun\u00E7\u00F5es comput\u00E1veis que n\u00E3o t\u00EAm programas \u00F3timos. Isto tamb\u00E9m descarta a ideia de que existe uma maneira de atribuir \u00E0s fun\u00E7\u00F5es arbitr\u00E1rias as suas pr\u00F3prias complexidades computacionais, significando a atribui\u00E7\u00E3o de qualquer f da complexidade de um programa \u00F3timo para f. \u00C9 claro que isto n\u00E3o exclui a possibilidade de encontrar a complexidade de um programa \u00F3timo para determinadas fun\u00E7\u00F5es espec\u00EDficas."@pt . "En Teor\u00EDa de la complejidad computacional el teorema del aumento de velocidad de Blum, dado primero por Manuel Blum en 1967, es un teorema importante sobre la complejidad de funciones computables. Cada funci\u00F3n computable tiene un n\u00FAmero infinito de representaciones en cierto lenguaje de programaci\u00F3n. En la , uno suele tener que encontrar el programa con la menor complejidad por una funci\u00F3n computable dada y una medida de complejidad. El teorema del aumento de velocidad de Blum dice que por cualquier medida de complejidad hay funciones computables que no tienen un programa m\u00EDnimo."@es . "Teorema dello speedup di Blum"@it . "Nella teoria della complessit\u00E0 computazionale, il Teorema dello speedup di Blum, proposto da Manuel Blum nel 1967, \u00E8 un importante teorema dello speedup riguardante la complessit\u00E0 delle funzioni calcolabili. Ogni funzione calcolabile ha un infinito numero di differenti rappresentazioni in un dato linguaggio di programmazione. Nella teoria della computabilit\u00E0 si ha spesso la necessit\u00E0 di trovare un algoritmo di minor complessit\u00E0 per una data funzione calcolabile e una data classe di complessit\u00E0."@it .