Verwandte Artikel zu Bounded Queries in Recursion Theory: 16 (Progress in...
Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic) - Hardcover
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.
- VerlagBirkhäuser
- Erscheinungsdatum1998
- ISBN 10 0817639667
- ISBN 13 9780817639662
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten376
- Kontakt zum HerstellerNicht verfügbar
Neu kaufen
Diesen Artikel anzeigen
EUR 52,78
EUR 2,30 für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Bounded Queries in Recursion Theory: 16 (Progress in...
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.55. Bestandsnummer des Verkäufers G0817639667I3N00
Anzahl: 1 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Anbieter: Orca Knowledge Systems, Inc., Novato, CA, USA
Verkäuferbewertung 4 von 5 Sternen
Hardcover. Zustand: Good. First Edition. No DJ. Ex University of California, Berkeley library book with usual library markings. Binding is tight, text clean. From the back cover: One of the major concerns of theoretical computer science is the classification 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. Bestandsnummer des Verkäufers mon0000018319
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. pp. 376. Bestandsnummer des Verkäufers 18317572
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 376. Bestandsnummer des Verkäufers 26317582
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. pp. 376 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Bestandsnummer des Verkäufers 7563089
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Anbieter: Midtown Scholar Bookstore, Harrisburg, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Very Good. no dust jacket as issued No dust jacket. Very Good hardcover with light shelfwear - NICE! Standard-sized. Bestandsnummer des Verkäufers mon0000117696
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Bounded Queries In Computability Theory (progress In Computer Science And Applied Logic (pcs))
Anbieter: Basi6 International, Irving, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Bestandsnummer des Verkäufers ABEJUNE24-129946
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Bounded Queries In Computability Theory (progress In Computer Science And Applied Logic (pcs))
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Bestandsnummer des Verkäufers ABNR-83245
Anzahl: 1 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Gebunden. Zustand: New. Bestandsnummer des Verkäufers 5975588
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Bounded Queries in Recursion Theory
Verlag:
Birkhäuser Boston, Birkhäuser Boston Dez 1998, 1998
ISBN 10: 0817639667
ISBN 13: 9780817639662
Neu
Hardcover
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. 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 9780817639662
Anzahl: 1 verfügbar