Skip to main content

The Man in a Tailcoat

  • Chapter
  • First Online:
Wandering Towards a Goal

Part of the book series: The Frontiers Collection ((FRONTCOLL))

  • 990 Accesses

Abstract

Yesterday around midnight I had an interesting conversation with an elegant man. With a top hat and a curious glass walking cane, he was standing on the parapet of a bridge, looking down at the dark river below his feet.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    ‘L’uomo in Frack’ (The Man in a Tailcoat), also known as ‘Vecchio Frack’, is a poignant song by the italian singer and composer Domenico Modugno (1928–1994). Written in 1955, it describes the last hours of a mysterious character and is inspired by the true story of Raimondo Lanza di Trabia.

  2. 2.

    In the context of the computational universe conjecture, the usual answer to the question “What is the goal of the universal computation?” is: “To compute the universe’s own evolution” [6]. For each initial segment of the computation the ‘goal’ has been... just to push the universe up to that point. Tautological as it may sound, the answer has a genuine message: there is no shortcut to describing the evolution of the universe, other than going through it step-by-step.

  3. 3.

    When each micro-state \(c_i\) in C(X) has its own probability \(p_i\), the entropy is \(S \propto - \sum _i p_i log (p_i)\).

References

  1. Bolognesi, T.: Spacetime computing: towards algorithmic causal sets with special-relativistic properties. In: Adamatzky, A. (ed.) Advances in Unconventional Computing - vol. 1: Theory, vol. 22. Emergence, Complexity and Computation, pp. 267–304. Springer, Berlin (2017). Chap. 12

    Google Scholar 

  2. Cook, M.: Universality in elementary cellular automata. Complex Syst. 15, 1–40 (2004)

    MathSciNet  MATH  Google Scholar 

  3. Cook, J.D.: How to compute log factorial. Posted 16 August 2010. https://www.johndcook.com/blog/2010/08/16/how-to-compute-log-factorial/

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability—A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  5. Hutter, M., Legg, S., Vitanyi, P.M.B.: Algorithmic probability. Scholarpedia 2(8), 2572 (2007). (Revision 151509)

    Article  ADS  Google Scholar 

  6. Lloyd, S.: Universe as quantum computer. Complexity 3(1), 32–35 (1997)

    Article  ADS  MathSciNet  Google Scholar 

  7. Penrose, R.: Cycles of Time. The Bodley Head, London (2010)

    Google Scholar 

  8. Rovelli, C.: Meaning and intentionality = information + evolution. In: Aguirre, A., Foster, B., Merali, Z. (eds.) Wandering Towards a Goal - How Can Mindless Mathematical Laws Give Rise to Aims and Intentions. Springer, Berlin (2018). (This volume)

    Google Scholar 

  9. Wolfram, S.: A New Kind of Science. Wolfram Media, Inc., Champaign (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tommaso Bolognesi .

Editor information

Editors and Affiliations

Appendix—H Versus S via Log-Factorial Approximation

Appendix—H Versus S via Log-Factorial Approximation

In general, we can rewrite the 1-block entropy \(H^{(n_0 + n_1)}\) of Eq. (16.8) (where \(n_0+n_1 = 600\)) as:

$$\begin{aligned} H^{n_0 + n_1}((n_0, n_1))= & {} (n_0 + n_1)\Bigg (-\frac{n_0}{n_0 + n_1} log_2 \frac{n_0}{n_0 + n_1} -\frac{n_1}{n_0 + n_1} log_2 \frac{n_1}{n_0 + n_1}\Bigg ) \nonumber \\= & {} (n_0 + n_1) log_2(n_0 + n_1) - n_0 log_2(n_0) - n_1 log_2(n_1) \end{aligned}$$
(16.11)

Using base-2 logarithms and proportionality factor 1, the Boltzmann entropy of Eq. (16.10), relative to tuples with bit count \((n_0, n_1)\), becomes:

$$\begin{aligned} S((n_0, n_1))= & {} log_2 \frac{(n_0+n_1)!}{n_0! n_1!} \nonumber \\= & {} log_2e * (log((n_0+n_1)!) - log(n_0!) - log(n_1!)) \end{aligned}$$
(16.12)

where log() denotes the base e natural logarithm. By using the following approximation of the log-factorial function [3]:

$$\begin{aligned} log(n!) \approx \Bigg (n + \frac{1}{2}\Bigg ) log(n+1) - (n+1) + \frac{1}{2} log(2\pi ) + \frac{1}{12(n+1)} \end{aligned}$$
(16.13)

we further develop Eq. (16.12) as follows:

$$\begin{aligned} S((n_0, n_1))\approx & {} \Bigg (n_0 + n_1 + \frac{1}{2}\Bigg ) log_2(n_0 + n_1 + 1) - \Bigg (n_0 + \frac{1}{2}\Bigg ) log_2(n_0 + 1) \nonumber \\&- \Bigg (n_1 + \frac{1}{2}\Bigg ) log_2(n_1 + 1) + SS(n_0, n_1) \end{aligned}$$
(16.14)

where:

$$\begin{aligned} SS(n_0, n_1)= & {} log_2(e) - \frac{1}{2} log_2(2\pi ) + \frac{log_2(e)}{12}\Bigg (\frac{1}{n_0 + n_1 + 1} - \frac{1}{n_0 + 1} - \frac{1}{n_1 + 1}\Bigg ) \nonumber \\= & {} 0.117 + 0.120\Bigg (\frac{1}{n_0 + n_1 + 1} - \frac{1}{n_0 + 1} - \frac{1}{n_1 + 1}\Bigg ) \end{aligned}$$
(16.15)

Clearly the contribution of \(SS(n_0, n_1)\) is negligible, while the first three terms of the approximated \(S((n_0, n_1))\) of Eq. (16.14) parallel closely the three terms in the expansion of \(H^{n_0+n_1}\) provided by Eq. (16.11). This explains the closeness of the two plots in Fig. 16.5-left.

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bolognesi, T. (2018). The Man in a Tailcoat. In: Aguirre, A., Foster, B., Merali, Z. (eds) Wandering Towards a Goal. The Frontiers Collection. Springer, Cham. https://doi.org/10.1007/978-3-319-75726-1_16

Download citation

Publish with us

Policies and ethics