Register

NIELIT 2016 MAR Scientist B - Section C: 30

• recategorized by
1,199 views
1 votes
1 votes

Bounded minimalization is a technique for

  1. proving whether a promotive recursive function is turning computable or not
  2. proving whether a primitive recursive function is a total function or not
  3. generating primitive recursive functions
  4. generating partial recursive functions
• recategorized by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

362
views
0 answers
1 votes
admin asked Mar 31, 2020
362 views
NIELIT 2016 MAR Scientist B - Section C: 33
In what module multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun?Non reusable moduleSerially usableRe-enterable moduleRecursive module
User Avatar
1.2k
views
1 answers
1 votes
admin asked Mar 31, 2020
1,210 views
NIELIT 2016 MAR Scientist B - Section C: 46
According to Brooks, if $n$ is the number of programmers in a project team, then the number of communication path is$n(n-1)/2$n\log n$n$n(n+1)/2$
User Avatar
1.5k
views
1 answers
0 votes
admin asked Mar 31, 2020
1,507 views
NIELIT 2016 MAR Scientist B - Section C: 47
In object oriented design of software, objects haveattributes and name onlyoperations and name onlyattributes name and operationsmutation and permutation property
User Avatar
609
views
1 answers
0 votes
admin asked Mar 31, 2020
609 views
NIELIT 2016 MAR Scientist B - Section C: 48
The shellaccepts command from the usermaintains directories of filestranslates the keyboard’s character codesnone of these
User Avatar
Link Copied!