Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
mike00632
on Jan 9, 2019
|
parent
|
context
|
favorite
| on:
Unprovability comes to machine learning
Right, but note that we can use numbers from countable sets and find different symbolic representations for them (3.0 vs 3). That problem is not inherent from the uncountability of the real numbers.
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: