Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
cartoffal
on April 22, 2025
|
parent
|
context
|
favorite
| on:
Flat origami is Turing complete (2023)
Turing completeness and P completeness are completely different things. There is no sense in which P-completeness is a "more specific" version of Turing-completeness.
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
