Idioma: Inglés
Publicado por Springer Netherlands, Springer Netherlands Sep 2014, 2014
ISBN 10: 940179216X ISBN 13: 9789401792165
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware -Ranging from Alan Turing¿s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer¿s solipsistic attitude to logic, there remain points of disagreement to this day.Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing¿s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics.This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability¿s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 102,28
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. reprint edition. 228 pages. 9.25x6.10x0.52 inches. In Stock.
Idioma: Inglés
Publicado por Springer Netherlands, Springer, 2016
ISBN 10: 9402407073 ISBN 13: 9789402407075
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 57,68
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Ranging from Alan Turing's seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer's solipsistic attitude to logic, there remain points of disagreement to this day.Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing's ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics.This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability's adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.
Librería: preigu, Osnabrück, Alemania
EUR 50,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Constructivity and Computability in Historical and Philosophical Perspective | Jacques Dubucs (u. a.) | Taschenbuch | xi | Englisch | 2016 | Springer | EAN 9789402407075 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 58,56
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Ranging from Alan Turing's seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer's solipsistic attitude to logic, there remain points of disagreement to this day.Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing's ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics.This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability's adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.
Librería: Buchpark, Trebbin, Alemania
EUR 37,96
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Ranging from Alan Turing¿s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer¿s solipsistic attitude to logic, there remain points of disagreement to this day.Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing¿s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics.This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability¿s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 126,11
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 178,80
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 2014 edition. 228 pages. 9.25x6.25x0.75 inches. In Stock.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 46,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 46,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer Netherlands Sep 2016, 2016
ISBN 10: 9402407073 ISBN 13: 9789402407075
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Ranging from Alan Turing's seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer's solipsistic attitude to logic, there remain points of disagreement to this day.Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing's ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics.This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability's adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. 228 pp. Englisch.
Idioma: Inglés
Publicado por Springer Netherlands Sep 2014, 2014
ISBN 10: 940179216X ISBN 13: 9789401792165
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Ranging from Alan Turing's seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer's solipsistic attitude to logic, there remain points of disagreement to this day.Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing's ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics.This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability's adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. 228 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 72,77
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 228 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 73,36
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 228.
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Offers an in depth look at the relationship between computability and constructivityFollows the developments from Turing s ground-breaking linkage between computation and the machine and the final resolution between proof theoretical semantics and.
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Offers an in depth look at the relationship between computability and constructivityFollows the developments from Turing s ground-breaking linkage between computation and the machine and the final resolution between proof theoretical semantics and.
Idioma: Inglés
Publicado por Springer Netherlands, Springer Sep 2016, 2016
ISBN 10: 9402407073 ISBN 13: 9789402407075
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Ranging from Alan Turing¿s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer¿s solipsistic attitude to logic, there remain points of disagreement to this day.Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing¿s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics.This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability¿s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch.
Librería: preigu, Osnabrück, Alemania
EUR 50,25
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. Constructivity and Computability in Historical and Philosophical Perspective | Jacques Dubucs (u. a.) | Buch | xi | Englisch | 2014 | Springer | EAN 9789401792165 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.