How can it be proven that the Kleene's T predicate is primitive recursive?
up vote
0
down vote
favorite
I have a function that is written in terms of the Kleene's $text T$ predicate. the function is:
enter image description here
I need to show that the function is primitive recursive. in order to do that, I need to show that the Kleene's T predicate is primitive recursive. I've tried but I've failed. the failed effort was to say that the function gives the value by a turing machine in a specific configuration or it gives 0 hence it is primitive recursive. My professor said it is wrong. Can anybody help how it can be shown that the T predicate is primitive recursive?
logic
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
asked Nov 16 at 21:09
jadenperesl
11
add a comment |
up vote
0
down vote
favorite
I have a function that is written in terms of the Kleene's $text T$ predicate. the function is:
enter image description here
I need to show that the function is primitive recursive. in order to do that, I need to show that the Kleene's T predicate is primitive recursive. I've tried but I've failed. the failed effort was to say that the function gives the value by a turing machine in a specific configuration or it gives 0 hence it is primitive recursive. My professor said it is wrong. Can anybody help how it can be shown that the T predicate is primitive recursive?
logic
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
asked Nov 16 at 21:09
jadenperesl
11
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I have a function that is written in terms of the Kleene's $text T$ predicate. the function is:
enter image description here
I need to show that the function is primitive recursive. in order to do that, I need to show that the Kleene's T predicate is primitive recursive. I've tried but I've failed. the failed effort was to say that the function gives the value by a turing machine in a specific configuration or it gives 0 hence it is primitive recursive. My professor said it is wrong. Can anybody help how it can be shown that the T predicate is primitive recursive?
logic
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
asked Nov 16 at 21:09
jadenperesl
11
I have a function that is written in terms of the Kleene's $text T$ predicate. the function is:
enter image description here
I need to show that the function is primitive recursive. in order to do that, I need to show that the Kleene's T predicate is primitive recursive. I've tried but I've failed. the failed effort was to say that the function gives the value by a turing machine in a specific configuration or it gives 0 hence it is primitive recursive. My professor said it is wrong. Can anybody help how it can be shown that the T predicate is primitive recursive?
logic
logic
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
asked Nov 16 at 21:09
jadenperesl
11
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
asked Nov 16 at 21:09
jadenperesl
11
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
edited Nov 17 at 9:30
Mauro ALLEGRANZA
63.6k448110
63.6k448110
asked Nov 16 at 21:09
jadenperesl
11
asked Nov 16 at 21:09
jadenperesl
11
asked Nov 16 at 21:09
jadenperesl
11
11
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3001640%2fhow-can-it-be-proven-that-the-kleenes-t-predicate-is-primitive-recursive%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
