• English
    • Latviešu
    • Deutsch
    • русский
  • Help
  • English 
    • English
    • Latviešu
    • Deutsch
    • русский
  • Login
Search 
  •   DSpace Home
  • Search
  •   DSpace Home
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-1 of 1

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

On the reducibility of function classes 

Podnieks, Karlis (Latvia State University, 1972)
N – the set of all natural numbers, F – the set of all total functions N→N, A, B<=F. We say that A is m-reducible to B (A<=m B), iff there is a recursive operator M such that f in A, iff M(f) in B for all f in F. Similarly, ...

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjects

My Account

Login

Discover

Author
Podnieks, Karlis (1)
Subjectm-reducibility (1)
recursive functions (1)
reducibility (1)tabular reducibility (1)Turing reducibility (1)... View MoreDate Issued
1972 (1)

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV