Download Subrecursive Programming Systems : Complexity and Succinctness
Download Subrecursive Programming Systems : Complexity and Succinctness
---------------------------------------------------------------
Author: John Case
Number of Pages: 253 pages
Published Date: 01 Oct 1994
Publisher: BIRKHAUSER BOSTON INC
Publication Country: Secaucus, United States
Language: English
ISBN: 9780817637675
File Name: Subrecursive.Programming.Systems.Complexity.and.Succinctness.pdf
Download Link: Subrecursive Programming Systems Complexity and Succinctness
---------------------------------------------------------------
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.
Read online Subrecursive Programming Systems : Complexity and Succinctness Buy Subrecursive Programming Systems : Complexity and Succinctness Download and read Subrecursive Programming Systems : Complexity and Succinctness ebook, pdf, djvu, epub, mobi, fb2, zip, rar, torrent Download to iPad/iPhone/iOS, B&N nook Subrecursive Programming Systems : Complexity and Succinctness
iphone keyboard extra symbols
Download The Art of Newspaper Making - Scholar's Choice Edition
Handbook of Cancer Immunology, Vol. 4 : Immune Status in Cancer Treatment & Prognosis download PDF, EPUB, Kindle
Download book Gardening Basics for Beginners : Gardening Basics for Beginners Series
Euripides' Iphigenia Among the Taurians download
The Problem of Faith and Freedom in the Last Two Centuries... pdf
The Waterborne: Environmentally Friendly Coating Technologies : Proceedings of 40th Annual International Waterborne, High-Solids, and Powder Coatings Symposium download torrent
Subrecursive Programming Systems : Complexity and Succinctness. John Case
Author: John Case
Number of Pages: 253 pages
Published Date: 01 Oct 1994
Publisher: BIRKHAUSER BOSTON INC
Publication Country: Secaucus, United States
Language: English
ISBN: 9780817637675
File Name: Subrecursive.Programming.Systems.Complexity.and.Succinctness.pdf
Download Link: Subrecursive Programming Systems Complexity and Succinctness
---------------------------------------------------------------
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.
Read online Subrecursive Programming Systems : Complexity and Succinctness Buy Subrecursive Programming Systems : Complexity and Succinctness Download and read Subrecursive Programming Systems : Complexity and Succinctness ebook, pdf, djvu, epub, mobi, fb2, zip, rar, torrent Download to iPad/iPhone/iOS, B&N nook Subrecursive Programming Systems : Complexity and Succinctness
More posts:
The Use of Computers in Anthropology download PDF, EPUB, Kindleiphone keyboard extra symbols
Download The Art of Newspaper Making - Scholar's Choice Edition
Handbook of Cancer Immunology, Vol. 4 : Immune Status in Cancer Treatment & Prognosis download PDF, EPUB, Kindle
Download book Gardening Basics for Beginners : Gardening Basics for Beginners Series
Euripides' Iphigenia Among the Taurians download
The Problem of Faith and Freedom in the Last Two Centuries... pdf
The Waterborne: Environmentally Friendly Coating Technologies : Proceedings of 40th Annual International Waterborne, High-Solids, and Powder Coatings Symposium download torrent