Orphan date March 2011 In cosmological perturbation theory , the scalar vector tensor decomposition is a decomposition of the most general linearized wiktionary perturbation perturbation s of the Friedmann Lemaitre Robertson Walker metric into components according to their transformations under spatial rotations. It was first discovered by E. M. Lifshitz in 1946. The general metric perturbation has ten degrees of freedom. The decomposition states that the evolution equations for the most general linearized perturbations of the Friedmann Lemaitre Robertson Walker metric can be decomposed into four scalars, two divergence divergence free spatial vector field s that is, with a spatial index running from 1 to 3 , and a trace linear algebra traceless , symmetric spatial tensor field with vanishing doubly and singly longitudinal components. The vector and tensor fields each have two independent components, so this decomposition encodes all ten degrees of freedom in the general metric perturbation. Using gauge invariance four of these components two scalars and a vector field may be set to zero. If the perturbed metric math g mu nu g mu nu h mu nu math where math h mu nu math is the perturbation, then the decomposition is as follows, math h 00 2 psi math math h 0i w i math math h ij 2 phi g ij S ij math where the Latin indices i and j run over spatial components 1, ,3 . The tensor field math S ij math is traceless under the spatial part of the background metric math g ij math i.e. math ..., respectively. The parallel component can be expressed as the gradient of a scalar, math w i nabla iA math . Thus math mathbf w math can be written as a combination of a scalar and a divergenceless ... S ij nabla i nabla j frac 1 3 g ij nabla 2 B math , where math B math is a scalar the combination ... to the direction of propagation, just like the photon. The advantage of this formulation is that the scalar ... scalar components and one vector component can further be eliminated by gauge transformation s. However ... more details
distinguish Scalar tensor vector gravity Bi scalar tensor vector gravity Tensor vector scalar gravity TeVeS , ref name Bekenstein2004 Citation arxiv astro ph 0403694 title Relativistic gravitation theory for the modified Newtonian dynamics paradigm year 2004 author Jacob D. Bekenstein journal Phys. Rev. D volume 70 issue 8 pages 083509 doi 10.1103 PhysRevD.70.083509 bibcode 2004PhRvD..70h3509B ref developed by Jacob Bekenstein , is a relativistic generalization of Mordehai Milgrom s Modified Newtonian dynamics MOdified Newtonian Dynamics MOND paradigm. ref name Milgrom1983 Citation bibcode 1983ApJ...270..365M title A modification of the Newtonian dynamics as a possible alternative to the hidden mass hypothesis year 1983 author M. Milgrom journal Astrophys. J. volume 270 pages 365 370 doi 10.1086 161130 ref The main features of TeVeS can be summarized as follows As it is derived from the action principle , TeVeS respects conservation laws In the weak field approximation of the spherically symmetric, static solution, TeVeS reproduces the MOND acceleration formula TeVeS avoids the problems of earlier attempts to generalize MOND, such as superluminal propagation As it is a relativistic theory it can accommodate gravitational lens gravitational lensing . The theory is based on the following ingredients A unit vector field A dynamical scalar field A nondynamical scalar field A matter Lagrangian constructed using an alternate Metric mathematics metric An arbitrary dimensionless function ... mu nu math , terms pertaining to a unit vector field math u alpha math and two scalar fields math sigma ... where math R math is the Ricci scalar and math g math is the determinant of the metric tensor. The scalar .... See also Modified Newtonian Dynamics Scalar tensor vector gravity General theory of relativity Law ... fluid Tensor vector geometric Vector Scalar physics Scalarscalar field References references Further ..., 2010.03.10 theories of gravitation DEFAULTSORT Tensor Vector Scalar Gravity Category Theories ... more details
Refimprove date May 2010 In theoretical physics , scalar field theory can refer to a Classical field theory classical or Quantum field theory quantum theory of scalar field s. A field which is invariant under any Lorentz transformation is called a scalar , in contrast to a vector field vector or tensor field . The quanta of the quantized scalar field are spin zero particles, and as such are boson s. No fundamental scalar fields have been observed in nature, though the Higgs boson may yet prove the first example. However, scalar fields appear in the effective field theory descriptions of many physical ... scalar, which is parity invariant. Because of the relative simplicity of the mathematics involved, scalar fields are often the first field introduced to a student of classical or quantum field theory ... simple form it is diagonal , and here we use the metric signature sign convention . Classical scalar field theory Linear free theory The most basic scalar field theory is the linear theory. The Action physics action for the free theory of relativity relativistic scalar field theory is math mathcal ... generalization of the linear theory above is to add a scalar potential math V phi math to the equations ... nabla 2 phi V phi 0 math . Dimensional analysis and scaling Physical quantities in these scalar field ... be at the expense of making the connection with the quantum scalar field slightly more obscure ... some scalar field theories are Scale invariance scale invariant . While the actions above are all constructed ..., which are not rescaled under the transformation above. The condition for a scalar field theory ... scale or equivalently, mass scale in the theory. For a scalar field theory with D spacetime dimensions ... scalar field theory in math D 4 math is the massless math phi 4 math theory. Classical scale invariance ... a number of interesting phenomena in scalar field theory. The Lagrangian density is math ..., this solution is called a domain wall . Another well known example of a scalar field theory with kink ... more details
distinguish Tensor vector scalar gravity Bi scalar tensor vector gravity Scalar tensor vector gravity STVG ref cite news last McKee first M. date 25 January 2006 title Gravity theory dispenses with dark matter url http space.newscientist.com article.ns?id dn8631 work New Scientist accessdate 2008 07 26 ref is a modified theory of gravity developed by John Moffat physicist John Moffat , a researcher at the Perimeter Institute for Theoretical Physics in Waterloo, Ontario . The theory is also often referred to by the acronym MOG MO dified G ravity . Overview Scalar vector tensor gravity theory, ref name Moffat2006a cite journal last Moffat first J. W. year 2006 title Scalar Tensor Vector Gravity Theory journal Journal of Cosmology and Astroparticle Physics volume 3 pages 4 arxiv gr qc 0506021 doi 10.1088 1475 7516 2006 03 004 bibcode 2006JCAP...03..004M ref also known as MOdified Gravity MOG , is based on an action principle and postulates the existence of a vector field , while elevating the three constants of the theory to scalar fields . In the weak field approximation , STVG produces a Yukawa potential Yukawa like modification of the gravitational force due to a point source. Intuitively, this result can be described as follows far from a source gravity is stronger than the Newtonian prediction, but at shorter distances, it is counteracted by a repulsive fifth force due to the vector field. STVG has been used successfully to explain galaxy rotation curve s, ref name Moffat2006b cite journal last1 Brownstein first1 J. R. last2 Moffat first2 J. W. year 2006 title Galaxy Rotation ... of the theory, math G math , math mu math and math omega math , are promoted to scalar fields ... associated with the scalar fields. The STVG action integral takes the form math S int mathcal L ... Newtonian Dynamics Tensor vector scalar gravity Nonsymmetric Gravitational Theory References reflist 2 theories of gravitation DEFAULTSORT Scalar Tensor Vector Gravity Category Theories of gravitation ... more details
The Wavelet Scalar Quantization algorithm WSQ is a compression algorithm used for gray scale fingerprint images. It is based on wavelet theory and has become a standard for the exchange and storage of fingerprint images. WSQ was developed by the FBI , the Los Alamos National Laboratory , and the National Institute of Standards and Technology NIST . This compression method is preferred over standard compression algorithms like JPEG because at the same compression ratios WSQ doesn t present the blocking artifacts and loss of fine scale features that are not acceptable for identification in financial environments and criminal justice. ref cite book last1 Jain first1 Anil last2 Pankanti first2 Sharath title Advances in Fingerprint Technology chapter Automated Fingerprint Identification and Imaging Systems year 2001 publisher CRC Press isbn 978 0 8493 0923 6 pages 275 326 url http citeseerx.ist.psu.edu viewdoc summary?doi 10.1.1.21.380 edition 2nd ref External links http www.nist.gov itl iad ig wsq.cfm WSQ Fingerprint Image Compression Encoder Decoder Certification Guidelines http www.c3.lanl.gov brislawn index.html http www.wavelet.org References Reflist Category Graphics file formats Category Lossy compression algorithms Category Fingerprints ... more details
language ZPL . Examples In scalar languages like Fortran FORTRAN 77 FORTRAN 77 , C programming language ...Programming paradigms In computer science , array programming languages also known as vector or multidimensional languages generalize operations on scalar computing scalar s to apply transparently to vector geometric vector s, matrix mathematics matrices , and higher dimensional arrays. Array programming ... be dramatic in certain cases it is not uncommon to find array programming language one liner program ... Schidlowsky ref APL programming language APL , designed by Kenneth E. Iverson Ken Iverson , was the first programming language to provide array programming capabilities. The mnemonic APL refers to the title of his seminal book A Programming Language and not to arrays per se. Iverson s contribution .... Concepts The fundamental idea behind array programming is that operations apply at once to an entire set of values. This makes it a High level programming language high level programming model as it allows ... to explicit loops of individual scalar operations. Iverson described ref cite journal author Iverson ... behind array programming actually referring to APL as follows quote most programming languages are decidedly ... of executability and universality found in programming languages can be effectively combined, in a single ... of the many properties it suggests for explorations. ... Users of computers and programming languages ... derive more efficient algorithm. The basis behind array programming and thinking is to find and exploit ... which implicitly breaks down data to its constituent parts or scalar computing scalar quantities ... concept to array programming languages in general, by analogy to tensor rank in mathematics functions ..., for example, is a scalar ranked function because it operates on zero dimensional data ... collapses the input array by 1 dimension. Uses Array programming is very well suited to implicit ... or more cores are increasingly common today. Languages maincat Array programming languages The canonical ... more details
Use dmy dates date April 2012 Programming language lists A programming language is an artificial language ... . Programming languages can be used to create program machine programs that control the behavior of a machine and or to express algorithm s precisely. The earliest programming languages predate the History ... such as Jacquard loom s and player piano s. Thousands of different programming languages have been created, mainly in the computer field, with many more being created every year. Most programming languages describe computation in an imperative programming imperative style, i.e., as a sequence of commands, although some languages, such as those that support functional programming or logic programming , use alternative forms of description. The description of a programming language is usually ... document for example, the C programming language C programming language is specified ... 5 and earlier, have a dominant Programming language implementation implementation that is used as a reference implementation reference . TOC limit 4 Definitions A programming language is a notation ... name Aaby 2004 cite book last Aaby first Anthony title Introduction to Programming Languages year ... restrict the term programming language to those languages that can express all possible algorithms. ref name Aaby 2004 ref In mathematical terms, this means the programming language is Turing completeness Turing complete cite book last MacLennan first Bruce J. title Principles of Programming ... important for what constitutes a programming language include Function and target A computer programming language is a language ref name Fischer Steven R. Fischer, A history of language , Reaktion ... Machinery ACM SIGPLAN title Bylaws of the Special Interest Group on Programming Languages of the Association ... of computer programming languages languages that permit the specification of a variety of different ... tld courses cs148 02 programming.html title Programming Robots accessdate 23 September 2006 last ... more details
refimprove article date September 2007 In the context of computer programming, magic is an informal term for abstraction computer science abstraction it is used to describe code that handles complex tasks while hiding that complexity to present a simple interface. The term is somewhat tongue in cheek and carries good connotations, implying that the interface simplifies an otherwise difficult or tedious task. For example, Perl s type polymorphism polymorphic typing and closure computer science closure mechanisms are often called magic . The term implies that the hidden complexity is at least in principle understandable, in contrast to black magic programming black magic and deep magic , which describe arcane techniques that are deliberately hidden or extremely difficult to understand. Referential opacity main Referential transparency computer science In recent years, however, a negative interpretation of the term has been gaining popularity. In this usage, magic refers to procedures which make calculations based on data not clearly provided to them, by accessing other modules, memory positions or global Variable programming variables that they are not supposed to in other words, they are not Referential transparency computer science referentially transparent . According to most recent Software architecture software architecture models , even when using structured programming , it is usually preferred to make each function behave the same way every time the same arguments are passed to it, therefore following one of the basic principles of functional programming . When a function breaks this rule, it is often said to contain magic . A simplified example of negative magic is the following ... & 91 scalar value& 93 may be magical, that is, it has special features that a normal SV does not have ... computer programming comment that has an effect on the code is magic. Memory mapped I O addresses ... applied. See also Deep magic programming Magic number programming References references Use dmy ... more details
Basic programming may refer to Premium television Basic programming Basic television programming , the set of channels included in basic subscription to satellite or cable television Programming in one of the BASIC programming languages BASIC Programming , cartridge for the Atari 2600 console, released in 1979 disambig ... more details
Network programming may refer to one of several things Computer network programming Scheduling broadcasting Scheduling broadcast programs disambig ... more details
Semidefinite programming SDP is a subfield of convex optimization concerned with the optimization of a linear ... space , i.e., a spectrahedron . Semidefinite programming is a relatively new field of optimization ... and combinatorial optimization can be modeled or approximated as semidefinite programming problems ... matrix inequalities . SDPs are in fact a special case of conic optimization cone programming and can be efficiently solved by interior point methods . All linear programming linear programs can be expressed .... Finally, semidefinite programming has been used in the optimization optimization of complex systems . Motivation and Definition Initial Motivation A linear programming problem is one in which ... . In semidefinite programming, we instead use real valued vectors and are allowed to take the dot product of vectors. Specifically, a general semidefinite programming problem can be defined as any mathematical programming problem of the form math begin array rl displaystyle min x 1, ldots, x n in mathbb ... expressions involving nonnegative scalar mathematics scalar variables may be added to the program ... scalar product of math v i math and math v j math . Therefore, SDPs are often formulated in terms of linear expressions on scalar products of vectors. Given the solution to the SDP in the standard form ... Cholesky decomposition of X . Duality Theory Definitions Analogously to linear programming, given a general ... of the primal and dual SDPs are equal. This is known as strong duality . Unlike for Linear programming ... programming problem SPDLR . Software The following codes are available for SDP SDPA, CSDP, SDPT3, SeDuMi ... general convex optimization problems. Applications Semidefinite programming has been applied to find ... Vandenberghe, Stephen Boyd, Semidefinite Programming , SIAM Review 38, March 1996, pp. 49 95. http stanford.edu boyd papers pdf semidef prog.pdf pdf Monique Laurent, Franz Rendl, Semidefinite Programming and Integer Programming , Report PNA R0210, CWI, Amsterdam, April 2002. http www.optimization ... more details
Distinguish Scalar tensor vector gravity Tensor vector scalar gravity Incomplete date December 2011 Bi scalar tensor vector gravity theory BSTV ref Sanders, R.H. 2005 07 01 http arxiv.org abs astro ph 0502222v2 A tensor vector scalar framework for modified dynamics and cosmic dark matter Cornell University Library , retrieved July 11, 2010 ref is an extension of the tensor vector scalar gravity theory TeVeS ref Citation arxiv astro ph 0403694 title Relativistic gravitation theory for the modified Newtonian dynamics paradigm year 2004 author Jacob D. Bekenstein journal Phys. Rev. D volume 70 pages 083509 doi 10.1103 PhysRevD.70.083509 bibcode 2004PhRvD..70h3509B ref . TeVeS is a relativistic generalization of Mordehai Milgrom s Modified Newtonian Dynamics Modified Newtonian Dynamics MOND paradigm proposed by Jacob Bekenstein . ref Citation bibcode 1983ApJ...270..365M title A modification of the Newtonian dynamics as a possible alternative to the hidden mass hypothesis year 1983 author M. Milgrom journal Astrophys. J. volume 270 pages 365 370 doi 10.1086 161130 ref BSTV was proposed by R.H.Sanders. BSTV makes TeVeS more flexible by making a non dynamical scalar field in TeVeS into a dynamical one. ref Zhao, HongSheng Bacon, David J. Taylor, Andy N. Horne, Keith 2005 12 16 http arxiv.org abs astro ph 0509590 Testing Bekenstein s Relativistic MOND gravity with Lensing Data Cornell University Library , retrieved July 11, 2010 ref References Reflist phys stub DEFAULTSORT Bi Scalar Tensor Vector Gravity Category Theories of gravitation Category Theoretical physics Category Astrophysics ... more details
Unreferenced date January 2007 Exploratory programming is an important part of the software engineering cycle when a domain is not very well understood or open ended, or it s not clear what algorithms and data structures might be needed for an implementation, it s useful to be able to interactively develop and debug a program without having to go through the usual constraints of the edit compile run debug cycle. Many languages provide support for exploratory programming via interactivity, dynamicity, and extensibility, such as Cecil programming language Cecil , Dylan programming language Dylan , Factor programming language Factor , Lisp programming language Lisp , Mathematica , Obliq , Oz programming language Oz , Prolog , Python programming language Python , REBOL , Ruby programming language Ruby , Self programming language Self , Smalltalk and Tcl . See also Software Prototyping DEFAULTSORT Exploratory Programming Category Programming paradigms Soft eng stub ... more details
Programming often refers to computer programming , the act of instructing computers to perform tasks. In other contexts, it may also refer to Broadcast programming , scheduling content for television Radio programming , scheduling content for radio Programming music , generating music electronically Psychological programming , the use of hypnosis, illusion, mind control and brainwashing to program a mind Mathematical programming , or optimization disambig af Programmering ca Programaci de Programming fr Programmation homonymie ko it Programmazione nl Programmeren ja ru vi L p tr nh nh h ng ... more details
For the programming paradigm Dynamic programming language In mathematics and computer science , dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems ... programming is quite simple. In general, to solve a given problem, we need to solve different parts .... Often, many of these subproblems are really the same. The dynamic programming approach seeks to solve ... dynamic programming simply means storing the results of certain calculations, which are later used ... programming involves formulating a complex calculation as a Recursion recursive series of simpler calculations. History The term dynamic programming was originally used in the 1940s by Richard Bellman ... programming which restates an optimization problem in Recursion computer science recursive ... it sounded impressive. ref name Eddy Eddy, S. R., What is dynamic programming?, Nature Biotechnology, 22, 909 910 2004 . ref The word programming referred to the use of the method to find an optimal ... as that in the phrases linear programming and mathematical programming , a synonym for mathematical ... the bold line is the overall shortest path from start to goal. Dynamic programming is both a mathematical optimization method and a computer programming method. In both contexts it refers to simplifying ... inside larger problems, so that dynamic programming methods are applicable, then there is a relation ... the Bellman equation . Dynamic programming in mathematical optimization In terms of mathematical optimization , dynamic programming usually refers to simplifying a decision by breaking it down into a sequence .... Dynamic programming in computer programming There are two key attributes that a problem must have in order for dynamic programming to be applicable optimal substructure and overlapping subproblem s. However ... Divide and conquer algorithm divide and conquer rather than dynamic programming . This is why ... programming problems. Optimal substructure means that the solution to a given optimization problem ... more details
Distinguish Synthetic Programming HP 41 Multiple issues context March 2009 notability March 2009 refimprove March 2009 orphan February 2010 Synthetic programming refers to assembly language programming in scripting language s. Implementations vary from Inline assembler inline assembly to better wrapped machine instructions. Implementations Python programming language Python Corepy http www.corepy.org AutoHotkey http www.autohotkey.com forum topic21172.html AutoIt http www.autoitscript.com forum index.php?showtopic 86672 Category Computer programming Compu prog stub ... more details
Expert subject Computer science date November 2008 In computer programming within the subject oriented programmingProgramming paradigm paradigm , subjects are a way to separation of concerns separate concern s. For example, in a Shape class with two methods Draw and Move , each method would be considered a subject. External links http www.research.ibm.com sop IBM Subject oriented programming page http www.alphaworks.ibm.com tech hyperj Hyper J is an example of this concept. Compu lang stub Category Object oriented programming Category Programming paradigms Category Programming principles ... more details
In computer science , typeful programming is a programming style identified by widespread use of type theory type information handled through mechanical typechecking techniques. ref name Cardelli The concept was introduced in a paper of the same name by Luca Cardelli in 1991. ref name Cardelli The Haskell programming language Haskell programming language is said to be typeful. ref name Cardelli cite journal last Cardelli first Luca year 1991 title Typeful programming journal IFIP State of the Art Reports publisher Springer Verlag location New York issue Formal Description of Programming Concepts pages 431 507 url http www.lucacardelli.name Papers TypefulProg.pdf ref References references Category Programming paradigms Category Type theory compu prog stub ... more details
A programming game is a computer game where the player has no direct influence on the course of the game. Instead, a computer program or script is written in some domain specific programming language in order to control the actions of the characters usually robot s, tank s or bacteria , which seek to destroy each other . Most programming games can be considered environments of digital organism s, related to artificial life simulations. A few programming games of note include AI Wars , Core War , and RoboWar , among many others. There are different tournament s and leagues for the programming games where the characters can compete with each other. Usually a script is optimized for a special strategy. Programming games may be derived from almost any other type of game. For example, the World Computer Chess Championship consists of matches between programs written for the abstract strategy game of chess . Also, some non computer games borrow elements of programming games in the board game RoboRally , players arrange cards to program their pieces with a sequence of moves, causing moves to be made without the knowledge of one s opponents preceding moves. See also Portal box Robotics Video games Category Programming games Programming games category List of digital organism simulators External links http programminggames.org The Programming Games Wiki http www.dmoz.org Games Video Games Simulation Programming Games Programming Game list at DMOZ http www.aiforge.net game links.htm Many inactive and nonexistent programming games at AIforge http retrocode.blogspot.com 2009 09 history of programming games 1961 1989.html A History of Programming Games http sourceforge.net projects earliestgames Earliest and Similar Games now in C, Turn Based, or Color and Speed in Linux Ncurses VideoGameGenre videogame software stub Category Programming games Category Video game genres de Programmierspiel ru uk ... more details
Unreferenced auto yes date December 2009 Strip programming is a technique used for programming television and radio to ensure consistency and coherency. Television program Television or radio program s of a particular style are given a regular time slot during the week. For example, radio and television Broadcasting broadcasters may program a european classical music classical music program at 1 p.m. every day. Strip programming is used to deliver consistent content to targeted audiences. Broadcasters know or predict the times at which certain demographics will be listening to or watching their programs and play them at that time. Drive time and prime time programming is a classic example of strip programming, with similar content being broadcast every day at the same time to target specific demographics. Strip programming is sometimes criticized as making programming too predictable and reducing diversity and uniqueness. DEFAULTSORT Strip Programming Category Television terminology Category Radio terminology tv term stub nl Horizontale programmering ... more details
nofootnotes date October 2008 The Practice of Programming ISBN 0 201 61586 X by Brian W. Kernighan and Rob Pike is a 1999 book about computer programming and software engineering , published by Addison Wesley . According to the preface, the book is about topics like testing, debugging , porting portability , performance, design alternatives, and style, which, according to the authors, are not usually the focus of computer science or programming courses . ref http cm.bell labs.com cm cs tpop preface.html Preface ref It treats these topics in case studies, featuring implementations in several programming language s mostly C programming language C , but also C , AWK programming language AWK , Perl and Tcl . The Practice of Programming has been translated into twelve languages. References reflist External links http cm.bell labs.com cm cs tpop Bell Labs homepage http tpop.awl.com Website for the book compu book stub Rob Pike navbox DEFAULTSORT Practice of Programming Category Software engineering books Category 1999 books ... more details
Refimprove date February 2010 Programming paradigms In software development , programming in the large and programming in the small describe two different approaches to writing software. The terms were coined by Frank DeRemer and Hans Kron in their 1975 paper Programming in the large versus programming ... an individual program is created is different from how a programming systems product is created. ref ... engineer, is complete in itself, and is ready to run on the system on which it was developed. The programming .... This is the endeavor that DeRemer and Kron describe as programming in the small. Compare with the activities associated with a programming systems project, again as identified by Brooks. Such a project ... how programming systems projects are typically run as formal projects that follow industry best ... about programming in the large vs in the small taken from the abstract of their paper see the references ... , possibly written by different people. We need languages for programming in the small, i.e. languages not unlike the common programming languages of today, for writing modules. We also need a module ... machines. Programming in the large In software development , programming in the large can involve computer programmingprogramming by larger groups of people or by smaller groups over longer time periods ... complicated, programs that can be challenging for maintainers to understand. With programming in the large, coding managers place emphasis on partitioning work into Modularity programming module .... With programming in the large, program changes can become difficult. ref name Brooks If a change ... goal of programming in the large involves setting up modules that will not need altering in the event ... cohesion and loose Coupling computer science coupling . Programming in the large requires abstraction ... define interactions that have precision and demonstrable correctness. Programming in the large ... by Frank DeRemer and Hans Kron in their 1976 paper Programming in the Large Versus Programming ... more details
Refimprove date August 2008 Infobox book name The Tao of Programming image http www.geoffreyjames.com taocover.jpg Cover page author Geoffrey James writer Geoffrey James illustrator Gloria Garland cover artist Gloria Garland country United States language English language English subject Computer programming genre Computer programming , Satire publisher InfoBooks pub date 1987 media type Print Paperback pages 151 isbn 0 931137 07 1 dewey 005 19 congress QA76.6 .J354 1987 oclc 13904639 followed by The Zen of Programming The Tao of Programming is a book written in 1987 by Geoffrey James . Written in a tongue in cheek style spoof of classic Taoist texts such as the Tao Te Ching and Zhuangzi which belies its serious message. The Tao of Programming consists of a series of short anecdotes divided into nine books The Silent Void The Ancient Masters Design Coding Maintenance Management Corporate Wisdom Hardware and Software Epilogue The themes of the book espouse many Hacker programmer subculture hacker ideals &ndash managers should leave programmers to their work code should be small, elegant, and maintainable corporate wisdom is more often than not an oxymoron and so on. Geoffrey James wrote two more books like The Tao of Programming The Zen of Programming in 1988 and Computer Parables Enlightenment in the Information Age in 1989. However, they have not been as well received. Citation ... version of The Tao of Programming http huffman.sourceforge.net tao tao of programming.html An online version of The Tao of Programming http catb.org esr writings unix koans The Unix Koans of Master ... http livecn.huasing.org tao of programming.htm A Chinese translation of The Tao of Programming http www.hvaonline.net hvaonline posts list 22570.hva A Vietnamese translation of The Tao of Programming DEFAULTSORT Tao Of Programming, The Category Software development books Category 1987 books Category ... of Programming ... more details
Unreferenced date December 2009 In ordinary computer programming, the programmer keeps the program s intended results in mind and painstakingly constructs a computer program to achieve those results. Inferential programming refers to still mostly hypothetical techniques and technologies enabling the inverse. Inferential programming would allow the programmer to describe the intended result to the computer using a metaphor such as a fitness function , a test specification, or a logical specification and then the computer would construct its own program to meet the supplied criteria. During the 1980s, approaches to achieve inferential programming mostly revolved around techniques for logical inference . Today the term is sometimes used in connection with evolutionary computation techniques that enable the computer to evolve a solution in response to a problem posed as a fitness or reward function. Closely related concepts and technologies PROLOG Artificial intelligence Genetic programming Machine learning Artificial life Evolution Metaprogramming See also Computer science Compiler theory Unit testing DEFAULTSORT Inferential Programming Category Programming paradigms Category Hypothetical technology ... more details
Orphan date February 2009 The slow programming movement is part of the slow movement . It is a software development philosophy that emphasises careful design, quality code, software testing and thinking. It strives to avoid kludge s, buggy code, and overly quick release cycles. External links http openbooklab.com slow programming a new approach to software development Slow Programming A new approach to software development http www.di.uniovi.es cernuda noprog ENG.html How NOT to go about a programming assignment An ironic description of a fast programming paradigm http norvig.com 21 days.html Teach Yourself Programming in Ten Years An essay on developing expertise in programming, by Peter Norvig http www.martinfowler.com bliki TechnicalDebt.html Technical Debt Technical Debt, by Martin Fowler http www.computer.org portal web buildyourcareer Nosce te Ipsum blogs top ten idea killers in software development Top Ten Idea Killers in Software Development Top Ten Idea Killers in Software Development, by Navneeth Mandavilli Category Slow movement Category Software development philosophies compu prog stub ... more details
Encyclopedia
top
