메뉴 건너뛰기




Volumn 286, Issue , 2012, Pages 117-137

Timed sets, functional complexity, and computability

Author keywords

Complexity measures; Computability; Functional complexity; Restriction categories; Turing categories

Indexed keywords

COMPUTATIONAL COMPLEXITY;

EID: 84879239784     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2012.08.009     Document Type: Conference Paper
Times cited : (11)

References (12)
  • 3
    • 0037028444 scopus 로고    scopus 로고
    • Restriction categories I: Categories of partial maps
    • J. R. B. Cockett and S. Lack, Restriction Categories I: Categories of partial maps. Theoretical Computer Science, Vol 270 (2002) 223-259.
    • (2002) Theoretical Computer Science , vol.270 , pp. 223-259
    • Cockett, J.R.B.1    Lack, S.2
  • 4
    • 43449087629 scopus 로고    scopus 로고
    • Restriction categories III: Colimits, partial limits and extensivity
    • J.R.B. Cockett and S. Lack, Restriction categories III: colimits, partial limits and extensivity. Mathematical Structures in Computer Science, Vol 17 (2007) 775-817.
    • (2007) Mathematical Structures in Computer Science , vol.17 , pp. 775-817
    • Cockett, J.R.B.1    Lack, S.2
  • 10
    • 0001305668 scopus 로고
    • Dominical categories: Recursion theory without elements
    • R.A. Di Paola and A. Heller, Dominical categories: recursion theory without elements. Journal of Symbolic Logic, Vol. 52 (1987), 595-635.
    • (1987) Journal of Symbolic Logic , vol.52 , pp. 595-635
    • Paola, R.A.D.1    Heller, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.