Timeline for Computability of a function and decidability [closed]
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 1, 2017 at 16:12 | comment | added | Yuval Filmus | @venkat Your post doesn't reflect your actual question. Please update it. (Don't use the word "edit" in your edit.) | |
| Dec 1, 2017 at 11:33 | history | closed |
Evil chi David Richerby fade2black Yuval Filmus |
Needs details or clarity | |
| Nov 28, 2017 at 11:43 | answer | added | user80502 | timeline score: 1 | |
| Nov 28, 2017 at 9:53 | comment | added | venkat | @dylan61 the question is not alone about computable functions the in the above mentioned options both were given correct i dont know how to prove if Lf is recursively enumberable then f is computable please help | |
| Nov 28, 2017 at 9:48 | comment | added | venkat | the question is about determining what is true among the following options sir: option a: Lf is recursive iff f(x) is a computable function option b: Lf is recursively enumerable iff f(x) is computable @chi | |
| Nov 27, 2017 at 18:43 | comment | added | chi | What is the question? Also note that if $f$ is taken to be total (as you do above), then "the values outside the domain" do not exist. | |
| Nov 27, 2017 at 18:29 | review | Close votes | |||
| Dec 1, 2017 at 11:34 | |||||
| S Nov 27, 2017 at 18:19 | history | edited | Evil | CC BY-SA 3.0 |
Format mathematic expressions.
|
| S Nov 27, 2017 at 18:19 | history | suggested | user80502 | CC BY-SA 3.0 |
Format mathematic expressions.
|
| Nov 27, 2017 at 16:00 | comment | added | user80502 | Is the question about definition of computable functions ? | |
| Nov 27, 2017 at 15:53 | review | Suggested edits | |||
| S Nov 27, 2017 at 18:19 | |||||
| Nov 27, 2017 at 14:21 | review | First posts | |||
| Nov 27, 2017 at 18:14 | |||||
| Nov 27, 2017 at 14:21 | history | asked | venkat | CC BY-SA 3.0 |