Algebra and Logic · 1973 · 13 citations · 5 references
ComputingComputer ScienceMathematicsTheory Of ComputationChurch-turing ThesisComplexity TheoryComputability TheoryComputational ComplexityComputational Complexity ClassesTuring MachinesComputabilityComputable Reducibility
5
Generalized computations and second degree arithmetic
N. V. Belyakin · Algebra and Logic · 1970 · 12 citations
Constructively accessible ordinal numbers
Wayne Richter · Journal of Symbolic Logic · 1968 · 10 citations
Generalized computations and third-degree arithmetic
N. V. Belyakin · Algebra and Logic · 1974 · 10 citations