Return to Question

deleted 20 characters in body; edited tags

Source Link

edited Apr 22, 2013 at 11:20

72.9k
30
181
393

I've been trying for a while now to find a solution for the problem in the title: determining if a number is perfect using a Turing Machine. I only had one class on the TM and while I did "get" how it works, this particular algorithm is being really hard for me to develop.

The algorithm I'm trying to implement on the TM is basically this (on C, returns true iff n is a perfect number):

int main(int n) {
int n, int i=1, sum=0;

scanf(" %d", &n);
while (n>i n > i ) {
    if (n%i n % i == 0 ) {
      sum = sum + i;
}
i++;}
if(soma == n)
  }
  printf("Perfect number");
else i++;
  }

  printf("Notreturn asum perfect== number");n
return 0;}

The tough part for me right now is the while(n>i) loop and the n%i inside it.

Since I already have a program that does a%b, I was trying to build the TM graph around it, but I'm not sure it's the best idea, specially since the bb on this case changes on every iteration. The software I'm using to simulate the TM is called JFlap.

The algorithm on table or graph form would be perfect.

The algorithm I'm trying to implement on the TM is basically this(on C):

int main(){
int n, i=1, sum=0;

scanf(" %d", &n);
while(n>i){
if(n%i == 0){
    sum = sum + i;
}
i++;}
if(soma == n)
    printf("Perfect number");
else
    printf("Not a perfect number");
return 0;}

The tough part for me right now is the while(n>i) loop and the n%i inside it.

Since I already have a program that does a%b, I was trying to build the TM graph around it, but I'm not sure it's the best idea, specially since the b on this case changes on every iteration. The software I'm using to simulate the TM is called JFlap.

The algorithm on table or graph form would be perfect.

The algorithm I'm trying to implement on the TM is basically this (on C, returns true iff n is a perfect number):

int main(int n) {
  int i=1, sum=0;

  while ( n > i ) {
    if ( n % i == 0 ) {
      sum = sum + i;
    }
    i++;
  }

  return sum == n
}

The tough part for me right now is the while(n>i) loop and the n%i inside it.

Since I already have a program that does a%b, I was trying to build the TM graph around it, but I'm not sure it's the best idea, specially since the b on this case changes on every iteration. The software I'm using to simulate the TM is called JFlap.

The algorithm on table or graph form would be perfect.

Source Link

asked Apr 22, 2013 at 0:23

user7833

Algorithm to determine if a number is perfect on a Turing Machine

The algorithm I'm trying to implement on the TM is basically this(on C):

int main(){
int n, i=1, sum=0;

scanf(" %d", &n);
while(n>i){
if(n%i == 0){
    sum = sum + i;
}
i++;}
if(soma == n)
    printf("Perfect number");
else
    printf("Not a perfect number");
return 0;}

The tough part for me right now is the while(n>i) loop and the n%i inside it.

The algorithm on table or graph form would be perfect.

turing-machines