Cantitate/Preț
Produs
Total produse
Vezi coșul
Subrecursive Programming Systems: Complexity & Succinctness de James S. Royer

Subrecursive Programming Systems: Complexity & Succinctness: Progress in Theoretical Computer Science

Autor James S. Royer, John Case
en Limba Engleză Hardback – aug 1994

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 61896 lei  6-8 săpt.
  Birkhäuser Boston – 3 oct 2012 61896 lei  6-8 săpt.
Hardback (1) 62495 lei  6-8 săpt.
  Birkhäuser Boston – aug 1994 62495 lei  6-8 săpt.

Din seria Progress in Theoretical Computer Science

  • 20% Algorithms for Random Generation and Counting: A Markov Chain Approach
    Preț: 62007 lei
  • 20% The Graph Isomorphism Problem: Its Structural Complexity
    Preț: 62052 lei
  • 20% Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion
    Preț: 62545 lei
  • 20% Algol-like Languages
    Preț: 65042 lei
  • 20% Polynomial and Matrix Computations: Fundamental Algorithms
    Preț: 96150 lei
  • 20% Solving Higher-Order Equations: From Logic to Programming
    Preț: 62322 lei
  • 20% Object-Oriented Programming A Unified Foundation
    Preț: 63068 lei
  • 20% Categorical Combinators, Sequential Algorithms, and Functional Programming
    Preț: 63289 lei
  • 20% The Combinatory Programme
    Preț: 62132 lei
  • 20% Logic of Domains
    Preț: 62558 lei
  • 20% Interpolating Cubic Splines
    Preț: 57078 lei
  • 20% Neural Networks and Analog Computation: Beyond the Turing Limit
    Preț: 94994 lei
  • Canonical Equational Proofs
    Preț: 36545 lei
  • 20% Finite Automata, Formal Logic, and Circuit Complexity
    Preț: 67360 lei
  • 15% Semantics of Type Theory: Correctness, Completeness and Independence Results
    Preț: 56239 lei
  • 20% Complexity Theory of Real Functions
    Preț: 56712 lei
  • Verifying Temporal Properties of Systems
    Preț: 36399 lei
  • Nondeterminism in Algebraic Specifications and Algebraic Programs
    Preț: 37193 lei
  • Isomorphisms of Types: from ?-calculus to information retrieval and language design
    Preț: 37084 lei

Preț: 62495 lei

Preț vechi: 78120 lei
-20% Nou

Puncte Express: 937
Preț estimativ în valută:
11057€ • 12999$ • 9684£

Carte tipărită la comandă

Livrare economică 28 ianuarie-11 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780817637675
ISBN-10: 0817637672
Pagini: 253
Ilustrații: VIII, 253 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.54 kg
Ediția:1994
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Progress in Theoretical Computer Science

Locul publicării:Boston, MA, United States

Public țintă

Research

Cuprins

1 Introduction.- 1.1 What This Book is About.- 1.2 Outline of Part I. A Subrecursion Programming Systems Toolkit.- 1.3 Outline of Part II. Program Succinctness.- 1.4 Brief History of Prior Results.- 1.5 How to Use This Book.- 1.6 Acknowledgments.- I A Subrecursion Programming Systems Toolkit.- 2 Basic Notation and Definitions.- 3 Deterministic Multi-tape Turing Machines.- 4 Programming Systems.- 5 The LOOP Hierarchy.- 6 The Poly-Degree Hierarchy.- 7 Delayed Enumeration and Limiting Recursion.- 8 Inseparability Notions.- 9 Toolkit Demonstrations.- II Program Succinctness.- 10 Notions of Succinctness.- 11 Limiting-Recursive Succinctness Progressions.- 12 Succinctness for Finite and Infinite Variants.- 13 Succinctness for Singleton Sets.- 14 Further Problems.- Appendix A Exercises.- Appendix B Solutions for Selected Exercises.- Notation Index.