Skip to content

Fix typos #332

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Merged
merged 3 commits into from
May 22, 2023
Merged

Fix typos #332

merged 3 commits into from
May 22, 2023

Conversation

@vladh
Copy link
Contributor

@vladh vladh commented May 7, 2023

Thank you for this lovely textbook. :)

beastaugh
beastaugh reviewed May 7, 2023
View reviewed changes
content/computability/recursive-functions/non-pr-functions.tex

Of course, a more direct way to show that $g(x,y)$ is computable is to
describe a Turing machine that computes it, explicitly. This would,
in particular, avoid the Church-Turing thesis and appeals to
Copy link
Contributor

@beastaugh beastaugh May 7, 2023

Choose a reason for hiding this comment

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

This is not a typo.

@rzach rzach merged commit 85f416e into OpenLogicProject:master May 22, 2023
@rzach
Copy link
Member

rzach commented May 22, 2023

Thanks!

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

Reviewers

@rzach rzach rzach approved these changes

+1 more reviewer

@beastaugh beastaugh beastaugh left review comments

Reviewers whose approvals may not affect merge requirements

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

3 participants

@vladh @rzach @beastaugh