Feasible Computations and Provable Complexity Properties

Β· SIAM
4,0
2 Ρ€Π΅Ρ†Π΅Π½Π·ΠΈΠΈ
Π•-ΠΊΠ½ΠΈΠ³Π°
69
Π‘Ρ‚Ρ€Π°Π½ΠΈΡ†ΠΈ
Π‘ΠΎΠΎΠ΄Π²Π΅Ρ‚Π½Π°
ΠžΡ†Π΅Π½ΠΈΡ‚Π΅ ΠΈ Ρ€Π΅Ρ†Π΅Π½Π·ΠΈΠΈΡ‚Π΅ Π½Π΅ сС ΠΏΠΎΡ‚Π²Ρ€Π΄Π΅Π½ΠΈ Β Π”ΠΎΠ·Π½Π°Ρ˜Ρ‚Π΅ повСќС

Π—Π° Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°

An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory.

ΠžΡ†Π΅Π½ΠΈ ΠΈ Ρ€Π΅Ρ†Π΅Π½Π·ΠΈΠΈ

4,0
2 Ρ€Π΅Ρ†Π΅Π½Π·ΠΈΠΈ

ΠžΡ†Π΅Π½Π΅Ρ‚Π΅ ја Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°

ΠšΠ°ΠΆΠ΅Ρ‚Π΅ Π½ΠΈ ΡˆΡ‚ΠΎ мислитС.

Π˜Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΈ Π·Π° Ρ‡ΠΈΡ‚Π°ΡšΠ΅

ΠŸΠ°ΠΌΠ΅Ρ‚Π½ΠΈ Ρ‚Π΅Π»Π΅Ρ„ΠΎΠ½ΠΈ ΠΈ Ρ‚Π°Π±Π»Π΅Ρ‚ΠΈ
Π˜Π½ΡΡ‚Π°Π»ΠΈΡ€Π°Ρ˜Ρ‚Π΅ ја Π°ΠΏΠ»ΠΈΠΊΠ°Ρ†ΠΈΡ˜Π°Ρ‚Π° Google Play Books Π·Π° Android ΠΈ iPad/iPhone. Автоматски сС синхронизира со смСтката ΠΈ Π²ΠΈ ΠΎΠ²ΠΎΠ·ΠΌΠΎΠΆΡƒΠ²Π° Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ онлајн ΠΈΠ»ΠΈ ΠΎΡ„Π»Π°Ρ˜Π½ ΠΊΠ°Π΄Π΅ ΠΈ Π΄Π° стС.
Π›Π°ΠΏΡ‚ΠΎΠΏΠΈ ΠΈ ΠΊΠΎΠΌΠΏΡ˜ΡƒΡ‚Π΅Ρ€ΠΈ
МоТС Π΄Π° ΡΠ»ΡƒΡˆΠ°Ρ‚Π΅ Π°ΡƒΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΊΡƒΠΏΠ΅Π½ΠΈ ΠΎΠ΄ Google Play со ΠΊΠΎΡ€ΠΈΡΡ‚Π΅ΡšΠ΅ Π½Π° Π²Π΅Π±-прСлистувачот Π½Π° ΠΊΠΎΠΌΠΏΡ˜ΡƒΡ‚Π΅Ρ€ΠΎΡ‚.
Π•-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ ΠΈ Π΄Ρ€ΡƒΠ³ΠΈ ΡƒΡ€Π΅Π΄ΠΈ
Π—Π° Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ Π½Π° ΡƒΡ€Π΅Π΄ΠΈ со Π΅-мастило, ΠΊΠ°ΠΊΠΎ ΡˆΡ‚ΠΎ сС Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈΡ‚Π΅ Kobo, ќС Ρ‚Ρ€Π΅Π±Π° Π΄Π° ΠΏΡ€Π΅Π·Π΅ΠΌΠ΅Ρ‚Π΅ Π΄Π°Ρ‚ΠΎΡ‚Π΅ΠΊΠ° ΠΈ Π΄Π° ја ΠΏΡ€Π΅Ρ„Ρ€Π»ΠΈΡ‚Π΅ Π½Π° ΡƒΡ€Π΅Π΄ΠΎΡ‚. Π‘Π»Π΅Π΄Π΅Ρ‚Π΅ Π³ΠΈ Π΄Π΅Ρ‚Π°Π»Π½ΠΈΡ‚Π΅ упатства Π²ΠΎ Π¦Π΅Π½Ρ‚Π°Ρ€ΠΎΡ‚ Π·Π° помош Π·Π° ΠΏΡ€Π΅Ρ„Ρ€Π»Π°ΡšΠ΅ Π½Π° Π΄Π°Ρ‚ΠΎΡ‚Π΅ΠΊΠΈΡ‚Π΅ Π½Π° ΠΏΠΎΠ΄Π΄Ρ€ΠΆΠ°Π½ΠΈ Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ.