A problem about computability theory

  • Thread starter Thread starter iamwanli
  • Start date Start date
  • Tags Tags
    Theory
iamwanli
Messages
2
Reaction score
0
Soppose that A,B are effectively inseparable,B is r.e,then how to prove that \bar{A} is productive
 
Physics news on Phys.org
This isn't the place for homework. Also, when posting homework-type questions, you should state your definitions and what you've tried so far, rather than hoping that people will just give you an answer. Proper spelling and grammar wouldn't hurt either.

Anyways, what you've been asked to prove is false. Suppose B is r.e. but not recursive. If the above were true, then we could apply it taking A = \bar{B}. Then A and B are effectively inseparable because B is not recursive, so the hypotheses are satisfied. But the conclusion, that \bar{A} = B is productive must be false, since B is r.e.
 
Last edited:
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top