Articoli correlati a Theoretical computer science: Algorithm, Turing machine,...
Theoretical computer science: Algorithm, Turing machine, Computation, Formal language, Lambda calculus, Quantum computer, Idempotence - Brossura
Reseña del editor:
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 122. Chapters: Algorithm, Turing machine, Computation, Formal language, Lambda calculus, Quantum computer, Idempotence, Spintronics, Indirect self-reference, Pseudorandomness, Extractor, Quasi-empiricism in mathematics, Interactive computation, Granular computing, Rough set, Recursion, Exact cover, Natural computing, Π-calculus, Quantum algorithm, Dominance-based rough set approach, DNA computing, Krohn-Rhodes theory, Gödel Prize, Motion planning, Quantum digital signature, Scientific community metaphor, Categorical logic, Schwartz-Zippel lemma, Conditional random field, Automated reasoning, Semigroup action, Constrained Conditional Models, Markov random field, Corecursion, Pursuit-evasion, Bisimulation, Lowest common ancestor, Roger Schank, Promise theory, Bio-inspired computing, Chemical computer, Gustafson's law, Formal verification, Computational problem, Nominal terms, Institution, Recursive definition, Property testing, Task-oriented Information Modelling, Fredkin finite nature hypothesis, Markov logic network, Digital probabilistic physics, Computational irreducibility, Grammar systems theory, Notation for theoretic scheduling problems, Neighbour-sensing model, Algorithm engineering, Monge array, Computational overhead, European Association for Theoretical Computer Science, National Institute for Research in Computer Science and Control, Discrete tomography, British Colloquium for Theoretical Computer Science, Institutional model theory, ACM SIGACT, Journal of Automata, Languages and Combinatorics, Coinduction, Correctness, Simulation preorder, Dynamic data driven application system, Peptide computing, Bigraph, Computability in Europe, Full employment theorem, LogP machine, Probabilistic bisimulation, Knuth Prize, Expander mixing lemma, Hidden Markov random field, Concurrence, Epsilon-Biased Sample Spaces, Bridging model, ...
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreBooks LLC, Wiki Series
- Data di pubblicazione2011
- ISBN 10 1157644600
- ISBN 13 9781157644606
- RilegaturaTapa blanda
- Numero di pagine124
(nessuna copia disponibile)
Cerca: Inserisci un desiderataSe non trovi il libro che cerchi su AbeBooks possiamo cercarlo per te automaticamente ad ogni aggiornamento del nostro sito. Se il libro è ancora reperibile da qualche parte, lo troveremo!
Inserisci un desiderata