Computable Presentations

Computable Presentation is a formal representation of a mathematical structure in which the domain and operations are encoded via computable functions under a recursive naming system, enabling effective computation over the structure within the framework of computability theory.

12

Publications

356

Citations

18

Authors

15

Institutions

Publications per year

2017–2026

2

Authors

18

  1. AN
    André Nies

    University of Auckland, New Zealand

    2 publications · 88 citations

    2

    h-index

  2. ML
    Michael Lesnick

    University at Albany, State University of New York, United States

    1 publications · 41 citations

    1

    h-index

  3. RG
    Rodney G. Downey

    Victoria University of Wellington, New Zealand

    1 publications · 25 citations

    1

    h-index

  4. MW
    Matthew Wright

    University of Missouri, United States

    1 publications · 41 citations

    1

    h-index

  5. GL
    Geoffrey Laforte

    University of West Florida, United States

    1 publications · 25 citations

    1

    h-index

1–5 of 18

Venues

  1. Notre Dame Journal of Formal Logic

    2 publications · 88 citations

    2

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 32 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 83 citations

    1

    h-index

  4. SIAM Journal on Applied Algebra and Geometry

    SIAGA · 1 publications · 41 citations

    1

    h-index

  5. Lobachevskii Journal of Mathematics

    LJM · 1 publications · 13 citations

    1

    h-index

1–5