Feasible Mathematics II

Name: Feasible Mathematics II
Brand: Springer, Berlin
SKU: 9781461275824
Price: 52.64 EUR
Availability: InStock

Автор: Peter Clote, Jeffrey B. Remmel

Език:

Корици: С меки корици

Издател: Springer, Berlin

Наличност: Външен склад

Изпращаме след 5-8 дни

52.64 € 102.96 лв

Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I...

Информация за книгата

Автор

Peter Clote, Jeffrey B. Remmel

Език

Английски език

Корици

Книга - С меки корици

Издадена

2012

страници

447

EAN

9781461275824

ISBN

1461275822

Enbook ID

06795310

Издател

Springer, Berlin

Теглоt

691

Размери

155 x 235 x 23

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Feasible Mathematics II

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също