Super-Recursive Algorithms [Burgin 2004-12-01].pdf

(2182 KB) Pobierz
Monographs in Computer Science
Editors
David Gries
Fred B. Schneider
Monographs in Computer Science
Abadi and Cardelli,
A Theory of Objects
Benosman and Kang [editors],
Panoramic Vision: Sensors, Theory, and Applications
Broy and Stølen,
Specification and Development of Interactive Systems: FOCUS on
Streams, Interfaces, and Refinement
Brzozowski and Seger,
Asynchronous Circuits
Burgin,
Super-Recursive Algorithms
Cantone, Omodeo, and Policriti,
Set Theory for Computing: From Decision
Procedures to Declarative Programming with Sets
´
Castillo, Gutierrez, and Hadi,
Expert Systems and Probabilistic Network Models
Downey and Fellows,
Parameterized Complexity
Feijen and van Gasteren,
On a Method of Multiprogramming
Herbert and Sparck Jones [editors],
Computer Systems: Theory, Technology, and
¨
Applications
Leiss,
Language Equations
Levin, Heydon, and Mann,
Software Configuration Management with VESTA
McIver and Morgan [editors],
Programming Methodology
McIver and Morgan [editors),
Abstraction, Refinement and Proof for Probabilistic
Systems
Misra,
A Discipline of Multiprogramming: Programming Theory for Distributed
Applications
Nielson [editor],
ML with Concurrency
Paton [editor],
Active Rules in Database Systems
Selig,
Geometrical Methods in Robotics
Selig,
Geometric Fundamentals of Robotics, Second Edition
Shasha and Zhu,
High Performance Discovery in Time Series: Techniques and Case
Studies
Tonella and Potrich,
Reverse Engineering of Object Oriented Code
Mark Burgin
Super-Recursive
Algorithms
Mark Burgin
Department of Mathematics
UCLA
Los Angeles, CA 90095
U.S.A.
mburgin@math.ucla.edu
Series Editors:
David Gries
Cornell University
Department of Computer Science
Ithaca, NY 14853
U.S.A.
Fred B. Schneider
Cornell University
Department of Computer Science
Ithaca, NY 14853
U.S.A.
Library of Congress Cataloging-in-Publication Data
Burgin, M.S. (Mark Semenovich)
Super-recursive algorithms / Mark Burgin.
p. cm. — (Monographs in computer science)
Includes bibliographical references and index.
ISBN 0-387-95569-0 (alk. paper)
1. Recursive functions. 2. Algorithms. I. Title. II. Series.
QA9.615.B87 2005
511.3′52—dc22
2004041748
ISBN 0-387-95569-0
Printed on acid-free paper.
©2005
Springer Science+Business Media Inc.
All rights reserved. This work may not be translated or copied in whole or in part without
the written permission of the publisher (Springer Science+Business Media Inc., Rights and
Permissions, 233 Spring Street, New York, NY 10013 USA), except for brief excerpts in
connection with reviews or scholarly analysis. Use in connection with any form of informa-
tion storage and retrieval, electronic adaptation, computer software, or by similar or dissimi-
lar methodology now known or hereafter developed is forbidden.
The use in this publication of trade names, trademarks, service marks, and similar terms,
even if they are not identified as such, is not to be taken as an expression of opinion as to
whether or not they are subject to proprietary rights.
Printed in the United States of America.
9 8 7 6 5 4 3 2 1
springeronline.com
(TXQ/MV)
SPIN 10891097

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika:

Zgłoś jeśli naruszono regulamin