Skip to main content
added 29 characters in body
Source Link
Kaveh
  • 21.8k
  • 8
  • 84
  • 185

It would be better if you specified what you mean exactly by hyper-computation and gave evidence for why you think it has "died down".

In any case, assuming that you are talking about computation of functions over natural numberscomputation of functions over natural numbers (and finite strings) (since I think it is clear that models for higher type computation is a very active area, see e.g. CCA) and models of computation not-equivalent to Turing machinesmodels of computation not equivalent to computability defined by Turing machines, I don't think the claim is correct, for example see CiE'05 and CiE'11. Also see the criticisms made against the claim that hyper-computation is something new:

If you are interested, there is also some discussion on FOM mailing list starting by Timothy Chow's email about Martin Davis' article.

It would be better if you specified what you mean exactly by hyper-computation and gave evidence for why you think it has "died down".

In any case, assuming that you are talking about computation of functions over natural numbers (and finite strings) (since I think it is clear that models for higher type computation is a very active area, see e.g. CCA) and models of computation not-equivalent to Turing machines, I don't think the claim is correct, for example see CiE'05 and CiE'11. Also see the criticisms made against the claim that hyper-computation is something new:

If you are interested, there is also some discussion on FOM mailing list starting by Timothy Chow's email about Martin Davis' article.

It would be better if you specified what you mean exactly by hyper-computation and gave evidence for why you think it has "died down".

In any case, assuming that you are talking about computation of functions over natural numbers (and finite strings) (since I think it is clear that models for higher type computation is a very active area, e.g. CCA) and models of computation not equivalent to computability defined by Turing machines, I don't think the claim is correct, for example see CiE'05 and CiE'11. Also see the criticisms made against the claim that hyper-computation is something new:

If you are interested, there is also some discussion on FOM mailing list starting by Timothy Chow's email about Martin Davis' article.

added 32 characters in body
Source Link
Kaveh
  • 21.8k
  • 8
  • 84
  • 185

It would be better if you specified what you mean exactly by hyper-computation and gave evidence for why you think it has "died down".

In any case, assuming that you are talking about computation of functions over natural numbers (and finite strings) (since I think it is clear that models for higher type computation is a very active area, see e.g. CCA) and models of computation not-equivalent to Turing machines, I don't think the claim is correct, for example see CiE'05 and CiE'11. Also see the criticisms made against the claim that hyper-computation is something new:

If you are interested, there is also some discussion on FOM mailing list starting by Timothy Chow's emailTimothy Chow's email about Martin Davis' article.

It would be better if you specified what you mean exactly by hyper-computation and gave evidence for why you think it has "died down".

In any case, assuming that you are talking about computation of functions over natural numbers (and finite strings) (since I think it is clear that models for higher type computation is a very active area, see e.g. CCA) and models of computation not-equivalent to Turing machines, I don't think the claim is correct, for example see CiE'05 and CiE'11. Also see the criticisms made against the claim that hyper-computation is something new:

If you are interested, there is also some discussion on FOM mailing list starting by Timothy Chow's email about Martin Davis' article.

It would be better if you specified what you mean exactly by hyper-computation and gave evidence for why you think it has "died down".

In any case, assuming that you are talking about computation of functions over natural numbers (and finite strings) (since I think it is clear that models for higher type computation is a very active area, see e.g. CCA) and models of computation not-equivalent to Turing machines, I don't think the claim is correct, for example see CiE'05 and CiE'11. Also see the criticisms made against the claim that hyper-computation is something new:

If you are interested, there is also some discussion on FOM mailing list starting by Timothy Chow's email about Martin Davis' article.

Source Link
Kaveh
  • 21.8k
  • 8
  • 84
  • 185

It would be better if you specified what you mean exactly by hyper-computation and gave evidence for why you think it has "died down".

In any case, assuming that you are talking about computation of functions over natural numbers (and finite strings) (since I think it is clear that models for higher type computation is a very active area, see e.g. CCA) and models of computation not-equivalent to Turing machines, I don't think the claim is correct, for example see CiE'05 and CiE'11. Also see the criticisms made against the claim that hyper-computation is something new:

If you are interested, there is also some discussion on FOM mailing list starting by Timothy Chow's email about Martin Davis' article.