Peter Clote – författare
Visar alla böcker från författaren Peter Clote. Handla med fri frakt och snabb leverans.
8 produkter
Arithmetic, Proof Theory, and Computational Complexity
Inbunden, 1993
1811 kr
Lägg i varukorg
This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. Issuing from a two-year NSF and Czech Academy of Sciences …
Computational Molecular Biology
An Introduction
Inbunden, 2000
3678 kr
Lägg i varukorg
Recently molecular biology has undergone unprecedented development generating vast quantities of data needing sophisticated computational methods for analysis, processing and archiving. This requirement has given birth to the truly interdisciplinary field of computational biology, or …
Computational Molecular Biology
An Introduction
Häftad, 2000
1240 kr
Lägg i varukorg
Recently molecular biology has undergone unprecedented development generating vast quantities of data needing sophisticated computational methods for analysis, processing and archiving. This requirement has given birth to the truly interdisciplinary field of computational biology, or …
Feasible Mathematics II
Av Jeffrey B. Remmel, Peter Clote
E-bok, 2013
755 kr
Lägg i varukorg
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 …
Feasible Mathematics II
Av Peter Clote, Jeffrey B. Remmel
Häftad, 2011
570 kr
Lägg i varukorg
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 …
Boolean Functions and Computation Models
Av Peter Clote, Evangelos Kranakis
Inbunden, 2002
849 kr
Lägg i varukorg
The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is …
Boolean Functions and Computation Models
Av Peter Clote, Evangelos Kranakis
Häftad, 2010
825 kr
Lägg i varukorg
The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is …
Boolean Functions and Computation Models
Av Evangelos Kranakis, Peter Clote
E-bok, 2013
1059 kr
Lägg i varukorg
The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is …
