Effective Computability is a formal notion of computability that identifies a function as computable if and only if it can be computed by an effective method, specifically one that is finite, deterministic, and capable of being carried out mechanically without recourse to insight or ingenuity.
34
Publications
7.5K
Citations
48
Authors
40
Institutions
Publications per year
2017–2026
0
Variants
Algorithmic Computability
Parents
Publications
34
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
Robert I. Soare · Bulletin of Symbolic Logic · 1996 · 271 citations · Full text
Computability and physical theories
Robert Geroch, James B. Hartle · Foundations of Physics · 1986 · 190 citations
Computing, Mathematics, Physics +12
1–5 of 34
Authors
48
- RK
3
h-index
- OS
3
h-index
- RR
3
h-index
- PC
2
h-index
- DS
2
h-index
1–5 of 48
Institutions
40
University of Wisconsin–Madison
Madison, United States
3 h-index
3 publications
96 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
2 h-index
2 publications
47 citations
Swansea University
Swansea, United Kingdom
2 h-index
2 publications
2.6K citations
University of Algarve
Faro, Portugal
2 h-index
2 publications
47 citations
Cornell University
Ithaca, United States
2 h-index
2 publications
158 citations
Kazan Federal University
Kazan’, Russia
1 h-index
1 publications
16 citations
University of Auckland
Auckland, New Zealand
1 h-index
1 publications
37 citations
Swinburne University of Technology
Melbourne, Australia
1 h-index
1 publications
38 citations
1–8 of 40
Venues
- Electronic Notes in Theoretical Computer Science
ENTCS · 3 publications · 78 citations
3
h-index
- Mathematical logic quarterly
MLQ · 3 publications · 104 citations
3
h-index
- Theoretical Computer Science
2 publications · 81 citations
2
h-index
- Annals of Mathematics
1 publications · 710 citations
1
h-index
- Journal of Symbolic Logic
1 publications · 56 citations
1
h-index
1–5