Fixed-point Theorems In Computability

Fixed-Point Theorems in Computability is a theoretical framework within computability theory that establishes the existence of recursive functions or programs that are semantically equivalent to their own computational descriptions, thereby enabling self-referential constructions in formal systems.

23

Publications

747

Citations

30

Authors

27

Institutions

Publications per year

2017–2026

4

Authors

30

  1. MW
    Masako Washihara

    2 publications · 26 citations

    2

    h-index

  2. TM
    Takakazu Mori

    Kyoto Sangyo University, Japan

    2 publications · 80 citations

    2

    h-index

  3. DK
    Damian Kurpiewski

    Polish Academy of Sciences, Poland

    1 publications · 14 citations

    1

    h-index

  4. NS
    Nizar Souayah

    King Saud University, Saudi Arabia

    1 publications · 16 citations

    1

    h-index

  5. AB
    A. B. Khutoretskii

    1 publications · 13 citations

    1

    h-index

1–5 of 30

Venues

  1. Theoretical Computer Science

    2 publications · 80 citations

    2

    h-index

  2. Mathematica japonica

    2 publications · 26 citations

    2

    h-index

  3. Advances in Mathematics

    2 publications · 136 citations

    2

    h-index

  4. Algebra and Logic

    2 publications · 26 citations

    2

    h-index

  5. Choice Reviews Online

    CRO · 1 publications · 23 citations

    1

    h-index

1–5