Artículos relacionados a Subrecursive Programming Systems: Complexity &...
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science) - Tapa dura
Sinopsis
1.1. What This Book is About This book is a study of • subrecursive programming systems, • efficiency/program-size trade-offs between such systems, and • how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e.g., Lisp or Modula-2) for which there is a proof in some par ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
1.1. What This Book is About This book is a study of · subrecursive programming systems, · efficiency/program-size trade-offs between such systems, and · how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e.g., Lisp or Modula-2) for which there is a proof in some par ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.
Reseña del editor
This text develops the theory of subrecursive programming systems and applies it to the more general theory of structural complexity theory. Its first goal is to establish relative program succinctness between systems, improving and subsuming most prior results in this area and introducing several forms of the phenomena. Its second goal is to illustrate the applicability of these tools in the context of structural complexity theory. This book is suitable for researchers aquainted with the theory of computation and comfortable with mathematical proofs. It can also be used by computer science and mathematics advanced undergraduates and graduates.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 9,07
EUR 12,25 gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 85,41
GRATIS gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Subrecursive Programming Systems: Complexity &...
Imagen de archivo
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Publicado por
Birkh�user, 1994
ISBN 10: 0817637672
ISBN 13: 9780817637675
Antiguo o usado
Tapa dura
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Like New. Used - Like New. Book is new and unread but may have minor shelf wear. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Nº de ref. del artículo: Z1-F-038-01618
Gastos de envío:
EUR 12,25
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen de archivo
Subrecursive Programming Systems - Complexity And Succinctness
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: ABNR-91868
Cantidad disponible: 1 disponibles
Imagen de archivo
Subrecursive Programming Systems - Complexity And Succinctness
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJUNE24-129828
Cantidad disponible: 1 disponibles
Imagen de archivo
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Librería: ALLBOOKS1, Direk, SA, Australia
Calificación del vendedor: 5 de 5 estrellas
Nº de ref. del artículo: SHUB129828
Cantidad disponible: 1 disponibles
Imagen de archivo
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9780817637675
Cantidad disponible: 2 disponibles
Imagen del vendedor
Subrecursive Programming Systems : Complexity & Succinctness
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 5230727-n
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190237357
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Subrecursive Programming Systems
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 264. Nº de ref. del artículo: 263099809
Cantidad disponible: 1 disponibles
Imagen de archivo
Subrecursive Programming Systems
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 264 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Nº de ref. del artículo: 5829502
Gastos de envío:
EUR 7,49
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Subrecursive Programming Systems
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 264. Nº de ref. del artículo: 183099819
Gastos de envío:
EUR 9,95
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles