Feasible Mathematics II
Peter Clote Β· Jeffrey B. Remmel
03.2013β―Π³. Β· Progress in Computer Science and Applied Logic ΠΠ½ΠΈΠ³Π° 13 Β· Springer Science & Business Media
5,0star
1Β ΠΎΡΠ·ΠΈΠ²report
ΠΠ»Π΅ΠΊΡΡΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
447
Π‘ΡΡΠ°Π½ΠΈΡΠΈ
reportΠΡΠ΅Π½ΠΊΠΈΡΠ΅ ΠΈ ΠΎΡΠ·ΠΈΠ²ΠΈΡΠ΅ Π½Π΅ ΡΠ° ΠΏΠΎΡΠ²ΡΡΠ΄Π΅Π½ΠΈ Β ΠΠ°ΡΡΠ΅ΡΠ΅ ΠΏΠΎΠ²Π΅ΡΠ΅
ΠΡΠΈΡΠΊΠΎ Π·Π° ΡΠ°Π·ΠΈ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me? I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa tion device, such as a 'lUring machine or boolean circuit. Feasible math ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa rameters of the problem are the cause of its computational complexity and completeness, density and separation/collapse results are given for a struc ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D.
ΠΡΠ΅Π½ΠΊΠΈ ΠΈ ΠΎΡΠ·ΠΈΠ²ΠΈ
5,0
1Β ΠΎΡΠ·ΠΈΠ²
ΠΡΠ΅Π½Π΅ΡΠ΅ ΡΠ°Π·ΠΈ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
ΠΠ°ΠΆΠ΅ΡΠ΅ Π½ΠΈ ΠΊΠ°ΠΊΠ²ΠΎ ΠΌΠΈΡΠ»ΠΈΡΠ΅.
ΠΠ½ΡΠΎΡΠΌΠ°ΡΠΈΡ Π·Π° ΡΠ΅ΡΠ΅Π½Π΅ΡΠΎ
Π‘ΠΌΠ°ΡΡΡΠΎΠ½ΠΈ ΠΈ ΡΠ°Π±Π»Π΅ΡΠΈ
ΠΠ½ΡΡΠ°Π»ΠΈΡΠ°ΠΉΡΠ΅ ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΠ΅ΡΠΎ Google Play ΠΠ½ΠΈΠ³ΠΈ Π·Π° Android ΠΈ iPad/iPhone. Π’ΠΎ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ½ΠΎ ΡΠ΅ ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΠΈΡΠ° Ρ ΠΏΡΠΎΡΠΈΠ»Π° Π²ΠΈ ΠΈ Π²ΠΈ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ²Π° Π΄Π° ΡΠ΅ΡΠ΅ΡΠ΅ ΠΎΠ½Π»Π°ΠΉΠ½ ΠΈΠ»ΠΈ ΠΎΡΠ»Π°ΠΉΠ½, ΠΊΡΠ΄Π΅ΡΠΎ ΠΈ Π΄Π° ΡΡΠ΅.
ΠΠ°ΠΏΡΠΎΠΏΠΈ ΠΈ ΠΊΠΎΠΌΠΏΡΡΡΠΈ
ΠΠΎΠΆΠ΅ΡΠ΅ Π΄Π° ΡΠ»ΡΡΠ°ΡΠ΅ Π·Π°ΠΊΡΠΏΠ΅Π½ΠΈΡΠ΅ ΠΎΡ Google Play Π°ΡΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΏΠΎΡΡΠ΅Π΄ΡΡΠ²ΠΎΠΌ ΡΠ΅Π± Π±ΡΠ°ΡΠ·ΡΡΠ° Π½Π° ΠΊΠΎΠΌΠΏΡΡΡΡΠ° ΡΠΈ.
ΠΠ»Π΅ΠΊΡΡΠΎΠ½Π½ΠΈ ΡΠ΅ΡΡΠΈ ΠΈ Π΄ΡΡΠ³ΠΈ ΡΡΡΡΠΎΠΉΡΡΠ²Π°
ΠΠ° Π΄Π° ΡΠ΅ΡΠ΅ΡΠ΅ Π½Π° ΡΡΡΡΠΎΠΉΡΡΠ²Π° Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½ΠΎ ΠΌΠ°ΡΡΠΈΠ»ΠΎ, ΠΊΠ°ΡΠΎ Π½Π°ΠΏΡΠΈΠΌΠ΅Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½ΠΈΡΠ΅ ΡΠ΅ΡΡΠΈ ΠΎΡ Kobo, ΡΡΡΠ±Π²Π° Π΄Π° ΠΈΠ·ΡΠ΅Π³Π»ΠΈΡΠ΅ ΡΠ°ΠΉΠ» ΠΈ Π΄Π° Π³ΠΎ ΠΏΡΠ΅Ρ
Π²ΡΡΠ»ΠΈΡΠ΅ Π½Π° ΡΡΡΡΠΎΠΉΡΡΠ²ΠΎΡΠΎ ΡΠΈ. ΠΠ·ΠΏΡΠ»Π½Π΅ΡΠ΅ ΠΏΠΎΠ΄ΡΠΎΠ±Π½ΠΈΡΠ΅ ΠΈΠ½ΡΡΡΡΠΊΡΠΈΠΈ Π² ΠΠΎΠΌΠΎΡΠ½ΠΈΡ ΡΠ΅Π½ΡΡΡ, Π·Π° Π΄Π° ΠΏΡΠ΅Ρ
Π²ΡΡΠ»ΠΈΡΠ΅ ΡΠ°ΠΉΠ»ΠΎΠ²Π΅ΡΠ΅ Π² ΠΏΠΎΠ΄Π΄ΡΡΠΆΠ°Π½ΠΈΡΠ΅ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½ΠΈ ΡΠ΅ΡΡΠΈ.
