Question by littlemissy282003: A company supervisor asks for volunteers from the first shift to help assemble a new binding machine?
that must be on-line within the next 24 hours. Grady lifts his chin and his shoulders, mods, and says “I can do it.” In the social cognitive perspective of Albert Bandura, Grady has appraised a desired out come through self-evaluated
A. expectancies
B. emotions
C. strategies
D. competencies

Best answer:

Answer by kate
Time for you to read Albert Bandura and do your own homework.

Know better? Leave your own answer in the comments!

What is the maximum shifts a Turing Machine of Busy Beaver Type (starts on a blank tape) can perform on a limited region of tape?

Lets assume an n-state TM with a tape alphabet of m-symbols (you can assume 5-state 2-symbol if you like). The tape is unlimited on both directions but I am interrested on set of machines that halt after exploring a limited region of tape (lets call that k). I don’t care about non-halting machines as busy beaver problem (check wikipedia) states. I want to formulize max(shifts) in terms of n,m and k.

A simple answer would be shifts < n*m*k because n*m represents all the possible configurations an n,m TM can have on a single cell of tape and after that it has to repeat a visited configuration and loop forever; but in practice this optimality can’t be achieved, I search for a better upper bound of shift for an n,m TM within k cells of tape. TM must halt without exploring more than k cells.

Please ask for additional details if necessary.

that must be on-line within the next 24 hours. Grady lifts his chin and his shoulders, mods, and says “I can do it.” In the social cognitive perspective of Albert Bandura, Grady has appraised a desired out come through self-evaluated
A. expectancies
B. emotions
C. strategies
D. competencies