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.

*"synopsis" may belong to another edition of this title.*

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Quantity Available: 1

Seller:

Rating

**Book Description **Condition: New. New. Seller Inventory # STR-0817637672

Published by
Birkhäuser
(1994)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Hardcover
Quantity Available: 1

Seller:

Rating

**Book Description **Birkhäuser, 1994. Condition: New. book. Seller Inventory # M0817637672

Published by
BIRKHAUSER BOSTON INC, United States
(1994)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Hardcover
Quantity Available: 10

Seller:

Rating

**Book Description **BIRKHAUSER BOSTON INC, United States, 1994. Hardback. Condition: New. 1994 ed.. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. 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. Seller Inventory # LIE9780817637675

Published by
Birkhauser Boston Inc
(1994)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Birkhauser Boston Inc, 1994. HRD. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780817637675

Published by
BirkhÃ¤user
(2016)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **BirkhÃ¤user, 2016. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9780817637675_lsuk

Published by
Birkhauser Boston Inc
(1994)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Birkhauser Boston Inc, 1994. HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780817637675

Published by
BirkhÇÏuser
(1994)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Hardcover
Quantity Available: 1

Seller:

Rating

**Book Description **BirkhÇÏuser, 1994. Hardback. Condition: NEW. 9780817637675 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0285484

Published by
Springer

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Quantity Available: 1

Seller:

Rating

**Book Description **Springer. Condition: New. pp. 252. Seller Inventory # 5829502

Published by
Birkhäuser
(1994)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Hardcover
Quantity Available: 15

Seller:

Rating

**Book Description **Birkhäuser, 1994. Condition: New. This item is printed on demand for shipment within 3 working days. Seller Inventory # LP9780817637675

Published by
BIRKHAUSER BOSTON INC, United States
(1994)

ISBN 10: 0817637672
ISBN 13: 9780817637675

New
Hardcover
Quantity Available: 10

Seller:

Rating

**Book Description **BIRKHAUSER BOSTON INC, United States, 1994. Hardback. Condition: New. 1994 ed.. Language: English . Brand New Book ***** Print on Demand *****. 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. Seller Inventory # APC9780817637675