Leptobelistis
Leptobelistis is a genus of moths of the family Xyloryctidae.[1][2]
| Leptobelistis | |
|---|---|
| Scientific classification | |
| Kingdom: | |
| Phylum: | |
| Class: | |
| Order: | |
| Family: | |
| Genus: | Leptobelistis Turner, 1902 |
Species
- Leptobelistis asemanta Turner, 1902
- Leptobelistis isthmodes (Meyrick, 1922)
gollark: This isn't a paradox. It can't simulate arbitrarily large CGoL grids.
gollark: Nope! Many languages, abstractly speaking, *don't* have limited memory. Their implementations might, though.
gollark: No, Turing completeness means it can simulate any Turing machine. It *can't* do that if it has limited memory.
gollark: I don't know exactly what its instruction set is like. But if it has finite-sized addresses, it can probably access finite amounts of memory, and thus is not Turing-complete.
gollark: *Languages* can be, since they often don't actually specify memory limits, implementations do.
References
- funet.fi
- "LEPTOBELISTIS - Butterflies and Moths of the World". nhm.ac.uk. Retrieved 2016-12-15.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.