寄付 2024年9月15日 – 2024年10月1日募金について

Algorithms for Constructing Computably Enumerable Sets

Main
Algorithms for Constructing Computably...

Algorithms for Constructing Computably Enumerable Sets

Kenneth J. Supowit

0 / 0

この本はいかがでしたか？

ファイルの質はいかがですか？

質を評価するには、本をダウンロードしてください。

ダウンロードしたファイルの質はいかがでしたか？

年:

2023

出版社:

Birkhäuser

言語:

english

ページ:

191

ISBN 10:

3031269039

ISBN 13:

9783031269035

シリーズ:

Computer Science Foundations and Applied Logic

ファイル:

PDF, 2.38 MB

IPFS:

,

english, 2023

この書籍は、著作権所有者のクレームによりダウンロードできません。

Beware of he who would deny you access to information, for in his heart he dreams himself your master

— Pravin Lal

こちらはいかがでしょうか？

Yap C.K. — Theory of complexity classes

Jean Gallier — Introduction to the Theory of Computation. Some Notes for CIS262

Rod Downey, Denis R. Hirschfeldt — Algorithmic Randomness and Complexity

Noam Greenberg, Sanjay Jain, Keng Meng Ng, Sven Schewe, Frank Stephan, Guohua Wu & Yue Yang — Aspects of Computation and Automata Theory with Applications

S. Barry Cooper (auth.), S. Barry Cooper, Benedikt Löwe, Leen Torenvliet (eds.) — New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Proceedings

Rod Downey, Noam Greenberg — A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability

Gallier J — Notes on formal languages, automata, computability, and complexity

Joseph R. Shoenfield (Eds.) — Degrees of Unsolvability

Martin Davis, Elaine J. Weyuker — Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science

Davis, Martin;Sigal, Ron;Weyuker, Elaine J — Computability, complexity, and languages fundamentals of theoretical computer science

Daniel P. Bovet, Pierluigi Crescenzi — Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science)

Desconocido — New Computational Paradigms Changing Conceptions Of What Is Computable

Sorbi, Andrea — Complexity, logic, and recursion theory

Piergiorgio Odifreddi — Classical Recursion Theory: Volume II

Marius Zimand (Eds.) — Computational Complexity: A Quantitative Perspective

Edward R. Griffor (ed.) — Handbook of Computability Theory

F. R. Drake, S. S. Wainer — Recursion Theory, its Generalisations and Applications

Peter Cholak — Automorphisms of the Lattice of Recursively Enumerable Sets

N. K. Vereshchagin, A. Shen — Computable functions

Andrea Sorbi — Complexity, logic, and recursion theory

Rod Downey — Turing's Legacy: Developments from Turing's Ideas in Logic

S. Barry Cooper — Computability Theory

Andrew Hodges (auth.), S. Barry Cooper, Benedikt Löwe, Andrea Sorbi (eds.) — New Computational Paradigms: Changing Conceptions of What is Computable

S. Barry Cooper — Computability theory

Merlin Carl — Ordinal Computability: An Introduction to Infinitary Machines

Herbert Edelsbrunner (auth.), M. Fontet, K. Mehlhorn (eds.) — STACS 84: Symposium of Theoretical Aspects of Computer Science Paris, 11–13, 1984

James Abello, Krishna Kumar (auth.), Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete (eds.) — LATIN '95: Theoretical Informatics: Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings

主要なフレーズ