John Case – författare
Visar alla böcker från författaren John Case. Handla med fri frakt och snabb leverans.
11 produkter
11 produkter
Häftad, Engelska, 2022
222 kr
Skickas
Häftad, Engelska, 2005
302 kr
Skickas inom 3-6 vardagar
Inbunden, Engelska, 1994
1 114 kr
Skickas inom 10-15 vardagar
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.
Häftad, Engelska, 1996
280 kr
Skickas inom 3-6 vardagar
Häftad, Engelska, 2022
428 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2012
1 114 kr
Skickas inom 10-15 vardagar
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.
Häftad, Engelska
519 kr
Skickas inom 3-6 vardagar
Häftad, Engelska, 2004
561 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 15th International Conference on Algorithmic Learning Theory, ALT 2004, held in Padova, Italy in October 2004. The 29 revised full papers presented together with 5 invited papers and 3 tutorial summaries were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on inductive inference, PAC learning and boosting, statistical supervised learning, online sequence learning, approximate optimization algorithms, logic based learning, and query and reinforcement learning.
Engelska, 2014
644 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2022
137 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2008
298 kr
Tillfälligt slut
As an IT manager, you're expected to make key decisions and recommend major investments. And that means understanding your decisions' financial impact on your company. But if you're like many information technology practitioners, you may feel uncomfortable incorporating the financials into your day-to-day work. Using the groundbreaking formula they introduced in their book Financial Intelligence: A Manager's Guide to Knowing What the Numbers Really Mean, Karen Berman and Joe Knight present the essentials of finance specifically for IT experts. Drawing on their work training tens of thousands of managers and employees at leading organizations worldwide, the authors illuminate the basics of financial management and measurement and provide hands-on activities for practicing what you are reading.You'll discover: * Why the assumptions behind financial data matter * What your company's income statement, balance sheet, and cash flow statement reveal * How to use ratios to assess your company's financial health * How to calculate return on IT investments * Ways to use financial information to support your company's business units and do your own job better * How to instill financial intelligence throughout your team Authoritative and accessible, Financial Intelligence for IT Professionals empowers you to "talk numbers" confidently with your boss, colleagues, and direct reports -- and understand how the financials affect your part of the business.