4 ms·
While the oldest living trees are there, its not living trees that are being dated. If you find a timber used in the construction of the pyramid, you can then
by shagie 8y ago
While the oldest living trees are there, its not living trees that are being dated. If you find a timber used in the construction of the pyramid, you can then match its tree rings up with another set of tree rings that overlap, and so on back to the present age. In theory.
See https://www.crowcanyon.org/index.php/dendrochronology https://www.crowcanyon.org/index.php/dendrochronology
The challenge is there are gaps and spots where it doesn't quite match up. A bad few years and it throws the tree rings off. However, if you can pinpoint some reference event that spans the globe, you can line the samples back up again. This is known as cross dating ( http://www.ltrr.arizona.edu/lorim/basic.html http://www.ltrr.arizona.edu/lorim/basic.html ) - it doesn't need to have a living tree.
Radiocarbon dating will never be precise (being able to pin down a specific year) because of the probabilistic nature of decay and the errors on that are on the sample. Carbon dating only gives a one sigma. Something that is 3500 BP (before present) can have a +/- 60 year error on it. Give https://en.wikipedia.org/wiki/Calculation_of_radiocarbon_dates https://en.wikipedia.org/wiki/Calculation_of_radiocarbon_dat... a read.
- rl3 8y agoThat's incredibly interesting, thanks. >It doesn't need to have a living tree. Faulty assumption on my part. Obviously one can date dead wood just the same, I just assumed that non-living samples from ancient eras would be harder to come by or of lower quality having been deconstructed. While it seems that there's some truth to that, it couldn't be more wrong from a composite point of view.
- tabs_masterrace 8y agoThat's very cool, could be a interesting problem for using machine learning. Train it with all the pictures of tree rings with known age, and then see if it can reliably guess the age of something it hasn't seen.
- willvarfar 8y agoIts much more efficiently solved with the naive 'represent the distance between each adjacent ring as a number' and slide the array of numbers representing the sample along the known line and for each possible offset, calculate the error. Then you're left with some shortlist of candidate dates and their probabilities. It reminds me of the algorithms for locating reads on the genome.
- ghthor 8y agoThat's so darn cool. Dendrochronology seems like a science right out of a novel somewhere that someone said, wait, that might actually work in reality!