« first day (1903 days earlier)   

5:28 PM
Hello.
Why is the transition function in a Turing machine defined as a partial function? I'm trying to programmatically implement one such machine and I'm not certain as to why it would be imponderable for the machine to proceed with computation despite having transitioned into an accepting state. What am I missing?
 
vzn
6:03 PM
@userr2684291 there are different equivalent ways of defining halting (the idea behind the use of the partial function). what machine are you implementing?
 
@vzn OK. I'm implementing a simple model of a Turing machine.
Thank you, bye.
 
 
3 hours later…
9:02 PM
1
Q: Impolite to new users

ChoirbeanI've noticed that new users, who often ask rather poor questions, are often downvoted with no guidance at all, or are given harsh criticism without being welcomed into the community. The purpose of the First Posts review queue is to allow corrective suggestions, so downvotes without guidance are...

 

« first day (1903 days earlier)