Skip to content

Conversation

@Paul-Lez
Copy link
Member

No description provided.

Copy link
Collaborator

@callesonne callesonne left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This is mainly proofs so looks good to me, but I didn't review the original PR adding these files so can I ask: is the option in def step (M : Machine Γ Λ) : Cfg Γ Λ → Option (Cfg Γ Λ) really necessary? Couldn't you send ⟨none, t⟩ to ⟨none, t⟩ again? Instead of sending it to none. This is so that it could take values in Cfg Γ Λ which I feel would make some case work later easier. But I am not super familiar with Turing machines.

Comment on lines +62 to +67
def neverHalts : Machine Γ Λ := fun l s =>
match l, s with
| .S, .A => some (Λ.T, Stmt.write default Dir.right)
| .T, .A => some (Λ.S, Stmt.write default Dir.right)
| .S, .B => some (Λ.T, Stmt.write default Dir.left)
| .T, .B => some (Λ.T, Stmt.write default Dir.left)
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I'm slightly confused why we are putting definitions in a test file? Is it because this is not going into Mathlib eventually?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants