Verwandte Artikel zu Bounded Queries in Recursion Theory: 16 (Progress in...
Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic) - Softcover
Inhaltsangabe
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Críticas
"Ideal for an advanced undergraduate or beginning graduate student who has some exposure to basic computability theory and wants to see what one can do with it. The questions asked are interesting and can be easily understood and the proofs can be followed without a large amount of training in computability theory."
--Sigact News
Reseña del editor
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 74,85
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Bounded Queries in Recursion Theory: 16 (Progress in...
Foto des Verkäufers
Bounded Queries in Recursion Theory
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function. 372 pp. Englisch. Bestandsnummer des Verkäufers 9781461268482
Anzahl: 2 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 4189485
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory
Verlag:
Birkhäuser Boston, Birkhäuser Boston Jul 2013, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 372 pp. Englisch. Bestandsnummer des Verkäufers 9781461268482
Anzahl: 1 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory
Verlag:
Birkhäuser Boston, Birkhäuser Boston, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function. Bestandsnummer des Verkäufers 9781461268482
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9781461268482_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 20380255-n
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Anbieter: Best Price, Torrance, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. SUPER FAST SHIPPING. Bestandsnummer des Verkäufers 9781461268482
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9781461268482
Anzahl: 10 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 20380255
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory
Verlag:
Springer-Verlag New York Inc., 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
Neu
Paperback / softback
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 552. Bestandsnummer des Verkäufers C9781461268482
Anzahl: Mehr als 20 verfügbar