{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":52,"n_cols":5,"rows_kept":52,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[19,2,19,3],[20,2,20,3],[24,2,24,3],[31,2,31,3],[31,4,31,5],[32,2,32,3],[32,4,32,5],[33,2,33,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[38,2,38,3],[39,2,39,3],[46,2,46,3],[47,2,47,3],[50,2,50,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910824075303321"]
[null,null,"Autore",null,"Tourlakis George J"]
[null,null,"Titolo",null,"Theory of computation / / George Tourlakis"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, N.J., : Wiley, 2012"]
[null,null,"ISBN",null,"9786613622297"]
[{"$nulls":4},"9781280592461"]
[{"$nulls":4},"128059246X"]
[{"$nulls":4},"9781118315354"]
[{"$nulls":4},"1118315359"]
[{"$nulls":4},"9781118315361"]
[{"$nulls":4},"1118315367"]
[{"$nulls":4},"9781118315330"]
[{"$nulls":4},"1118315332"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (410 p.)"]
[null,null,"Classificazione",null,"MAT008000"]
[null,null,"Disciplina",null,"511.3/52"]
[null,null,"Soggetti",null,"Computable functions"]
[{"$nulls":4},"Functional programming languages"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Theory of Computation; CONTENTS; Preface; 1 Mathematical Foundations; 1.1 Sets and Logic;  Naïvely; 1.1.1 A Detour via Logic; 1.1.2 Sets and their Operations; 1.1.3 Alphabets, Strings and Languages; 1.2 Relations and Functions; 1.3 Big and Small Infinite Sets;  Diagonalization; 1.4 Induction from a User's Perspective; 1.4.1 Complete, or Course-of-Values, Induction; 1.4.2 Simple Induction; 1.4.3 The Least Principle; 1.4.4 The Equivalence of Induction and the Least Principle; 1.5 Why Induction Ticks; 1.6 Inductively Defined Sets; 1.7 Recursive Definitions of Functions; 1.8 Additional Exercises"]
[{"$nulls":4},"2 Algorithms, Computable Functions and Computations 2.1 A Theory of Computability; 2.1.1 A Programming Framework for Computable Functions; 2.1.2 Primitive Recursive Functions; 2.1.3 Simultaneous Primitive Recursion; 2.1.4 Pairing Functions; 2.1.5 Iteration; 2.2 A Programming Formalism for the Primitive Recursive Functions; 2.2.1 PR vs. L; 2.2.2 Incompleteness of PR; 2.3 URM Computations and their Arithmetization; 2.4 A Double Recursion that Leads Outside the Primitive Recursive Function Class; 2.4.1 The Ackermann Function; "]
[{"$nulls":4},"2.4.2 Properties of the Ackermann Function"]
[{"$nulls":4},"2.4.3 The Ackermann Function Majorizes All the Functions of PR 2.4.4 The Graph of the Ackermann Function is in PR*; 2.5 Semi-computable Relations;  Unsolvability; 2.6 The Iteration Theorem of Kleene; 2.7 Diagonalization Revisited;  Unsolvability via Reductions; 2.7.1 More Diagonalization; 2.7.2 Reducibility via the S-m-n Theorem; 2.7.3 More Dovetailing; 2.7.4 Recursive Enumerations; 2.8 Productive and Creative Sets; 2.9 The Recursion Theorem; 2.9.1 Applications of the Recursion Theorem; 2.10 Completeness; 2.11 Unprovability from Unsolvability"]
[{"$nulls":4},"3.5 Additional Exercises 4 Adding a Stack to a NFA: Pushdown Automata; 4.1 The PDA; 4.2 PDA Computations; 4.2.1 ES vs AS vs ES+AS; 4.3 The PDA-acceptable Languages are the Context Free Languages; 4.4 Non Context Free Languages;  Another Pumping Lemma; 4.5 Additional Exercises; 5 Computational Complexity; 5.1 Adding a Second Stack;  Turing Machines; 5.1.1 Turing Machines; 5.1.2 N P-Completeness; 5.1.3 Cook's Theorem; 5.2 Axt, Loop Program, and Grzegorczyk Hierarchies; 5.3 Additional Exercises; Bibliography; Index"]
[null,null,null,"Sommario/riassunto","\"In the (meta)theory of computing, the fundamental questions of the limitations of computing are addressed.  These limitations, which are intrinsic rather than technology dependent, may immediately rule out the existence of algorithmic solutions for some problems while for others they rule out efficient solutions.  The author's approach is anchored on the concrete (and assumed) practical knowledge about general computer programming, attained readers in a first year programming course, as well as the knowledge of discrete mathematics at the same level.  The book develops the meta-theory of general computing and builds on the reader's prior computing experience.  Metatheory via the programming formalism known as Shepherdson-Sturgis Unbounded Register Machines (URM)--a straightforward abstraction of modern high level programming languages--is developed.  Restrictions of the URM programming language are also discussed.  The author has chosen to focus on the high level language approach of URMs as opposed to the Turing Machine since URMs relate more directly to programming learned in prior experiences.  The author presents the topics of automata and languages only after readers become familiar, to some extent, with the (general) computability theory including the special computability theory of more \"practical\" functions, the primitive recursive functions.  Automata are presented as a very restricted programming formalism, and their limitations (in expressivity) and their associated languages are studied.  In addition, this book contains tools that, in principle, can search a set of algorithms to see whether a problem is solvable, or more specifically, if it can be solved by an algorithm whose computations are efficient.  Chapter coverage includes: Mathematical Background; Algorithms, Computable Functions, and Computations; A Subset of the URM Language: FA and NFA; and Adding a Stack to an NFA: Pushdown Automata\"--"]
[{"$nulls":4},"\"The book develops the meta-theory of general computing and builds on the reader's prior computing experience. Metatheory via the programming formalism known as Shepherdson-Sturgis Unbounded Register Machines (URM)--a straightforward abstraction of modern high-level programming languages--is developed. Restrictions of the URM programming language are also discussed. The author has chosen to focus on the high-level language approach of URMs as opposed to the Turing Machine since URMs relate more directly to programming learned in prior experiences\"--"]
[null,"2.","Record Nr.",null,"UNINA9910484865703321"]
[null,null,"Titolo",null,"Trusted Systems : 5th International Conference, INTRUST 2013, Graz, Austria, December 4-5, 2013, Proceedings / / edited by Roderick Bloem, Peter Lipp"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013"]
[null,null,"ISBN",null,"3-319-03491-X"]
[null,null,"Edizione",null,"[1st ed. 2013.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 103 p. 18 illus.)"]
[null,null,"Collana",null,"Security and Cryptology, , 2946-1863 ; ; 8292"]
[null,null,"Disciplina",null,"005.8"]
[null,null,"Soggetti",null,"Data protection"]
[{"$nulls":4},"Cryptography"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Operating systems (Computers)"]
[{"$nulls":4},"Data and Information Security"]
[{"$nulls":4},"Cryptology"]
[{"$nulls":4},"Operating Systems"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Hardware-Based Security and Applications -- Para-Virtualizing the Trusted Platform Module: An Enterprise -- Framework Based on Version 2.0 Specification -- The PACE/CA Protocol for Machine Readable Travel Documents -- A Spatial Majority Voting Technique to Reduce Error Rate of Physically Unclonable Functions -- Access Control, Integrity and Policy Enforcement."]
[null,null,null,"Sommario/riassunto","This book constitutes the thoroughly refereed conference proceedings of the 5th International Conference on Trusted Systems, INTRUST 2013, held in Graz, Austria, in December 2013. The revised full papers focus on the theory, technologies and applications of trusted systems. They cover all aspects of trusted computing systems, including trusted modules, platforms, networks, services and applications, from their fundamental features and functionalities to design principles, architecture and implementation technologies."]