{"product_id":"subrecursive-programming-systems-complexity-succinctness-von-john-case-james-s-royer","title":"Subrecursive Programming Systems","description":"\u003cp\u003e1.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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9780817637675\"\u003e\u003ch3\u003eComplexity \u0026amp; Succinctness\u003c\/h3\u003e\u003c\/div\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9781461266808\"\u003e\u003ch3\u003eComplexity \u0026amp; Succinctness\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Hardcover - 9780817637675","offer_id":50692773126,"sku":"9780817637675","price":106.99,"currency_code":"EUR","in_stock":true},{"title":"Softcover - 9781461266808","offer_id":39415697768541,"sku":"9781461266808","price":106.99,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/8186172f-b037-4c96-8023-4718c37d198c.jpg?v=1781325549","url":"https:\/\/shop.autorenwelt.de\/products\/subrecursive-programming-systems-complexity-succinctness-von-john-case-james-s-royer","provider":"Autorenwelt Shop","version":"1.0","type":"link"}