Consider a computer designed to run arbitrary interpreters. Not just the popular, already existing languages (e.g., JavaScript, Python, Java), but generically any interpreter for languages not even invented yet.
This universe of all interpreters is poorly defined, for now. How would one sample a "random" interpreter?
What would the hardware architecture of such a computer be like? Is any hardware acceleration possible in general? I suspect not. If not, we again return to the idea of a Turing-complete hash function.
No comments :
Post a Comment