649,814 Hits in 4.4 sec

Organized Complexity: is Big History a Big Computation? [article]

Jean-Paul Delahaye, Clement Vidal
2018 arXiv   pre-print
We argue in this paper that organized complexity is a valid and useful way to make sense of big history.  ...  Keywords: organized complexity, Kolmogorov complexity, logical depth, big history, cosmic evolution, evolution, complexity, complexification, computation, artificial life, philosophy of information  ...  This is because the computational content measures the causal history. A dead person still has had a complex history.  ... 
arXiv:1609.07111v2 fatcat:s5xbaeju4rakfpdfjyxnhbjkha

The Fastest Way of Computing All Universes [chapter]

Jürgen Schmidhuber
2012 A Computable Universe  
Is there a short and fast program that can compute the precise history of our universe, including all seemingly random but possibly actually deterministic and pseudo-random quantum fluctuations?  ...  We already know a short program that computes all constructively computable universes in parallel, each in the asymptotically fastest way.  ...  Is the past and future history of our entire universe simple or complex in this sense? Is there perhaps a very short program that calculates it, including us as observers?  ... 
doi:10.1142/9789814374309_0020 fatcat:myp7afciy5gcfgnmf3blgtnpoe

Analysis of the O-GEometric History Length Branch Predictor

Andre Seznec
2005 SIGARCH Computer Architecture News  
The set of used global history lengths forms a geometric series, i.e.,¨¢ © ¦ ¢ ! ¦ .  ...  As on perceptron predictors, the prediction is computed through the addition of the predictions read on the predictor tables.  ...  The impact of path aliasing on predictor accuracy is particularly important when a short global history is used. The O-GEHL predictor uses several tables indexed using short history lengths.  ... 
doi:10.1145/1080695.1070003 fatcat:uo7wwifpcbcdpkxzk4aswpuh24

On Knowledge distillation from complex networks for response prediction

Siddhartha Arora, Mitesh M. Khapra, Harish G. Ramaswamy
2019 Proceedings of the 2019 Conference of the North  
Recent advances in Question Answering have lead to the development of very complex models which compute rich representations for query and documents by capturing all pairwise interactions between query  ...  Specifically, we first investigate the conicity of representations learned by a complex model and observe that it is significantly lower than that of simpler models.  ...  Acknowledgements We thank Department of Computer Science and Engineering, and Robert Bosch Center for Data Sciences and Artificial Intelligence, IIT Madras (RBC-DSAI) for providing us with adequate compute  ... 
doi:10.18653/v1/n19-1382 dblp:conf/naacl/AroraKR19 fatcat:izz7jwlcw5e5hfrz656eybszpm

The Origins of Computational Mechanics: A Brief Intellectual History and Several Clarifications [article]

James P. Crutchfield
2017 arXiv   pre-print
We show that misguided evaluations of the contributions of computational mechanics are groundless and stem from a lack of familiarity with its basic goals and from a failure to consider its historical  ...  The principle goal of computational mechanics is to define pattern and structure so that the organization of complex systems can be detected and quantified.  ...  A causal state is a set of histories, all of which lead to the same set of futures. It's a simple dictum: Do not distinguish histories that lead to the same predictions of the future.  ... 
arXiv:1710.06832v1 fatcat:fgswe4bgi5echhftyjhrr3zs4m

Equivalent Modal Damping of Short-Span Bridges Subjected to Strong Motion

Sungchil Lee, Maria Q. Feng, Seung-Jun Kwon, Seok-Hee Hong
2011 Journal of Bridge Engineering  
In this paper four different methods are investigated for estimating the equivalent modal damping ratios of a short-span bridge under strong ground motion by considering the energy dissipation at the boundary  ...  Computed responses using the response-spectrum method with the equivalent damping ratios estimates are compared with the recorded responses.  ...  Joseph Penzien, Professor Emeritus at University of California, Berkeley, and Mr. Mike Keever and Mr. Lihong Sheng of Caltrans for their guidance and support.  ... 
doi:10.1061/(asce)be.1943-5592.0000149 fatcat:pbgco6n6tnbbpasdjqlcjte7mq

Computational Perspectives in the History of Science: To the Memory of Peter Damerow

Manfred D. Laubichler, Jane Maienschein, Jürgen Renn
2013 Isis  
This essay presents a brief summary of a computational research system for the history of science, discussing its implications for research, education, and publication practices and its connections to  ...  Computational methods and perspectives can transform the history of science by enabling the pursuit of novel types of questions, dramatically expanding the scale of analysis (geographically and temporally  ...  Together with a network of partners, we have already begun to develop many of the necessary elements of a computational infrastructure or research system for the history of science. 4 short version of  ... 
doi:10.1086/669891 pmid:23789513 fatcat:5krfosxsvvczpgkxng4byovn34

Bridging the semantic gap: Emulating biological neuronal behaviors with simple digital neurons

A. Nere, A. Hashmi, M. Lipasti, G. Tononi
2013 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA)  
The advent of non von Neumann computational models, specifically neuromorphic architectures, has engendered a new class of challenges for computer architects.  ...  We show that despite the simplicity of LLIF primitives, a broad class of complex neuronal behaviors can be emulated by composing assemblies of such primitives with low area and power overheads.  ...  Acknowledgment The authors would like to thank Dharmendra Modha, Paul Merolla, Steve Esser, our anonymous reviewers, and our paper shepherd Mark Oskin for their helpful comments and review of this manuscript  ... 
doi:10.1109/hpca.2013.6522342 dblp:conf/hpca/NereHLT13 fatcat:nhyq2y2avvbjvey5zavphcin3i

Page 23 of Journal of Aircraft Vol. 23, Issue 1 [page]

1986 Journal of Aircraft  
a consistent treatment of the time-history effects.  ...  , ¥ = 2, cOS(w,1) o=;1, o=a,; (9) Aerodynamic response histories of the pitching-moment, rolling-moment, and normal-force coefficients were computed from Eq. (1), with the aerodynamic coefficients obtained  ... 

Computational efficiency of fractional diffusion using adaptive time step memory [article]

Brian P. Sprouse, Christopher L. MacDonald, Gabriel A. Silva
2010 arXiv   pre-print
By including progressively fewer points as a function of time, a temporally 'weighted' history is computed that includes contributions from the entire past of the system, resulting in increased accuracy  ...  Sampled points along the system's history at progressively longer intervals are assumed to reflect the values of neighboring time points.  ...  Igor Podlubny for helpful discussions during the course of this work.  ... 
arXiv:1004.5128v1 fatcat:j3awgxk2cnevxpv7izpyfsxgsm

Data-Driven Modeling of Ship Maneuvers in Waves via Dynamic Mode Decomposition

2022 The 9th Conference on Computational Methods in Marine Engineering (Marine 2021)  
DMD also allows for short-term future estimates of the system's state, which can be used for real-time prediction and control.  ...  DMD is a dimensionality-reduction/reduced-order modeling method, which provides a linear finitedimensional representation of a possibly nonlinear system dynamics by means of a set of modes with associated  ...  Figure 5 shows the results of the DMD in producing the short-term prediction of the system dynamics, where the observed (past) time histories are depicted in black, the predicted (future) time histories  ... 
doi:10.2218/marine2021.6852 fatcat:lfhvpw5ykvejroamt2yu2q52lm

Seismic Solvability Problems [article]

August Lau, Chuan Yin
2012 arXiv   pre-print
We will use the same metaphor to separate what is solvable (simple part) and what is not solvable (complex part). This paper is a result of our presentation at a University of Houston seminar.  ...  In this paper, we will study seismic complexity through the eyes of solvability. We will investigate model complexity, data complexity and operator complexity.  ...  = Complex (Iow rank + low rank = high rank) Short history of solvability: << simplicity >> Quadratic equation (Complex numbers) Fundamental theorem of algebra (Gauss) Solvable by radicals (Abel)  ... 
arXiv:1212.1350v1 fatcat:ithynhp6obaxhop4a2orlo77zm

A Universal Measure of Intelligence for Artificial Agents

Shane Legg, Marcus Hutter
2005 International Joint Conference on Artificial Intelligence  
Thus intelligence is the ability to deal with a wide range of possibilities, not just a few specific situations.  ...  It also describes what we want to achieve in machines: A very general capacity to adapt and perform well in a wide range of situations.  ...  As each environment is described by a computable measure, one way of measuring the complexity of an environment is by taking its Kolmogorov complexity.  ... 
dblp:conf/ijcai/LeggH05 fatcat:qmnbd2vtkrbblitnfreiu7rrzi

Book Review: Neuroscience and IA Review of GazzanigaMichael S., Human: The Science Behind What Makes Us Unique. HarperCollins, New York, 2008, 447 pp., US$27.50, ISBN 978-0-06-089288-3

Robin Dunbar
2009 Evolutionary Psychology  
The long last chapter contains both a fascinating summary on the history of the discovery of how neurons work and a lengthy consideration of the rather daunting subject of brain prosthetics.  ...  It is such a simple sentiment, yet so full of human complexity. Other apes don't have that sentiment.  ...  The long last chapter contains both a fascinating summary on the history of the discovery of how neurons work and a lengthy consideration of the rather daunting subject of brain prosthetics.  ... 
doi:10.1177/147470490900700205 fatcat:ggfmnvaw4vcz3mt7n57ntt3da4

Scientific Knowledge from the Perspective of Quantum Cosmology [article]

James B. Hartle
1996 arXiv   pre-print
A third kind of limit concerns our ability to know theories through the process of induction and test.  ...  Such limits are inevitable if the world is complex and the laws governing the regularities of that world are simple.  ...  -is just a very long output of a short computer program with no input. However, in the history of scientific inquiry there is no evidence that the universe is so regular.  ... 
arXiv:gr-qc/9601046v1 fatcat:tf34aj5lgngrnncl65f4gqhdrq
« Previous Showing results 1 — 15 out of 649,814 results