Description

Book Synopsis

.- Invited abstracts.
.- Special Session: Computing Knowledge: Computational Aspects of Epistemic Logics (HaPoC).
.- The theory of enumeration degrees and its fragments.
.- Further extensions of the point to set principle.
.- Uniform distribution and algorithmic randomness.
.- Computable aspects of symbolic dynamics and tilings.
.- How much pattern complexity can help us solve the domino problem ?.
.- Sufficient conditions for non-emptiness of a subshift and computability of its entropy.
.- Reasoning about (Negative) Trust under Uncertainty.
.- Quantum computating from reversible classical computing.
.- Complexity of well-ordered sets  in an ordered Abelian group.
.- Invited papers.
.- If CiE Did not Exist, It Would be Necessary to Invent It.
.- Some Open Questions and Recent Results on Computable Banach  Spaces.
.- Kolmogorov complexity as a combinatorial tool.
.- Cellular Automata: Communicati

Twenty Years of Theoretical and Practical

Product form

£61.74

Includes FREE delivery

RRP £64.99 – you save £3.25 (5%)

Order before 4pm today for delivery by Sat 17 Jan 2026.

A Paperback by Ludovic Levy Patey

15 in stock


    View other formats and editions of Twenty Years of Theoretical and Practical by Ludovic Levy Patey

    Publisher: Springer
    Publication Date: 7/2/2024
    ISBN13: 9783031643088, 978-3031643088
    ISBN10: 3031643089
    Also in:
    Algorithms and data structures

    Description

    Book Synopsis

    .- Invited abstracts.
    .- Special Session: Computing Knowledge: Computational Aspects of Epistemic Logics (HaPoC).
    .- The theory of enumeration degrees and its fragments.
    .- Further extensions of the point to set principle.
    .- Uniform distribution and algorithmic randomness.
    .- Computable aspects of symbolic dynamics and tilings.
    .- How much pattern complexity can help us solve the domino problem ?.
    .- Sufficient conditions for non-emptiness of a subshift and computability of its entropy.
    .- Reasoning about (Negative) Trust under Uncertainty.
    .- Quantum computating from reversible classical computing.
    .- Complexity of well-ordered sets  in an ordered Abelian group.
    .- Invited papers.
    .- If CiE Did not Exist, It Would be Necessary to Invent It.
    .- Some Open Questions and Recent Results on Computable Banach  Spaces.
    .- Kolmogorov complexity as a combinatorial tool.
    .- Cellular Automata: Communicati

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account