Computability, Complexity, Logic

Main
Mathematics
Computability, Complexity, Logic

Computability, Complexity, Logic

E. Boerger

0 / 0

Sukakah anda buku ini?

Bagaimana kualiti fail ini?

Muat turun buku untuk menilai kualitinya

Bagaimana kualiti fail yang dimuat turun?

Kategori:

Tahun:

1989

Edisi:

1

Penerbit:

North Holland

Bahasa:

english

Halaman:

592

ISBN 10:

0444874062

ISBN 13:

9780444874061

Nama siri:

SLFM 128

Fail:

DJVU, 3.65 MB

IPFS:

,

english, 1989

Baca dalam Talian

Memuat turun (djvu, 3.65 MB)

Penukaran menjadi sedang dijalankan

Penukaran menjadi gagal

Mungkin anda berminat

E. Börger — Computability, complexity, logic

Bernard M. Moret — The Theory of Computation

F. D. Lewis — Essentials of Theoretical Computer Science

F. D. Lewis — Essentials of Theoretical Computer Science

F. D. Lewis — Essentials of Theoretical Computer Science

F. D. Lewis — Essentials of Theoretical Computer Science

F. D. Lewis — Essentials of Theoretical Computer Science

F. D. Lewis — Essentials of Theoretical Computer Science

F. D. Lewis — Essentials of Theoretical Computer Science

F. D. Lewis — Essentials of Theoretical Computer Science

J. M. Barzdin, J. J. Bičevskis (auth.), Dr. Jíří Bečvář (eds.) — Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975

Jones N. — Computability and Complexity: From a Programming Perspective

Neil D Jones — Computability And Complexity From A Programming Perspective

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

Davis M., Sigal R., Weyuker E. — Computability, complexity, and languages: Fundamentals of theoretical computer science

Sudkamp, Thomas A — Languages and machines: an introduction to the theory of computer science

Mallozzi J.S., De Lillo N.J. — Computability with PASCAL

R. Gregory Taylor — Models of Computation and Formal Languages

F. S. Beckman — Mathematical Foundations of Programming

Bernard M. Moret — The Theory of Computation

David Hopkin, Barbara Moss (auth.) — Automata

Mark Burgin — Super-Recursive Algorithms

Mark Burgin — Super-Recursive Algorithms

E. Börger — Computability, Complexity, Logic

Marek Karpinski, J. Van Leeuwen (ed.) — Topics in the theory of computation: selected papers of the International Conference on ’’Foundations of Computation Theory’’, FCT ’83, Borgholm, Sweden, August 21-27, 1983’

Arto Salomaa — Computation and automata

J. Glenn Brookshear — Theory of Computation: Formal Languages, Automata, and Complexity

R. Karp — Complexity of Computation

George J. Tourlakis — Computability

Nigel Cutland — Computability

K Svozil — Randomness And Undecidability In Physics

George Tourlakis — Computability

Jiří Bečvář (auth.), A. Blikle (eds.) — Mathematical Foundations of Computer Science: 3rd Symposium at Jadwisin near Warsaw, June 17–22, 1974

J. M. Barzdin, J. J. Bičevskis (auth.), Dr. Jíří Bečvář (eds.) — Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975

K. R. Apt, J. W. de Bakker (auth.), Antoni Mazurkiewicz (eds.) — Mathematical Foundations of Computer Science 1976: Proceedings, 5th Symposium, Gdańsk, September 6–10, 1976

Istilah utama