{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T19:52:13Z","timestamp":1672689133224},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0304-3975(01)00078-0","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"381-395","source":"Crossref","is-referenced-by-count":1,"title":["A manifesto for the computational method"],"prefix":"10.1016","volume":"282","author":[{"given":"Steve","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00078-0_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0304-3975(01)00078-0_BIB2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","article-title":"Every planar map is four colorable part I: discharging","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","article-title":"Every planar map is four colorable part II: reducibility","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"issue":"3","key":"10.1016\/S0304-3975(01)00078-0_BIB4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","article-title":"New algorithms for an ancient scheduling problem","volume":"51","author":"Bartal","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0304-3975(01)00078-0_BIB5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","article-title":"Multiprocessor scheduling with rejection","volume":"13","author":"Bartal","year":"2000","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB6","doi-asserted-by":"crossref","unstructured":"P. Berman, M. Charikar, M. Karpinski, A note on on-line load balancing for related machines, in: Proc. 5th Workshop on Algorithms and Data Structures, 1997, pp. 116\u2013125.","DOI":"10.1007\/3-540-63307-3_52"},{"issue":"4","key":"10.1016\/S0304-3975(01)00078-0_BIB7","first-page":"12","article-title":"Experimental mathematics: a discussion","volume":"18","author":"Borwein","year":"1996","journal-title":"Math. Intell."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB8","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01700692","article-title":"On formally undecidable propositions of Principia Mathematica and related systems","volume":"38","author":"G\u00f6del","year":"1931","journal-title":"Monatsh. Math. Phys."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB10","first-page":"23","article-title":"On the length of proofs","volume":"7","author":"G\u00f6del","year":"1936","journal-title":"Ergeb. Math. Kolloquiums"},{"issue":"2","key":"10.1016\/S0304-3975(01)00078-0_BIB11","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","article-title":"A better algorithm for an ancient scheduling problem","volume":"20","author":"Karger","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(01)00078-0_BIB12","doi-asserted-by":"crossref","unstructured":"H. Karloff, U. Zwick, A 7\/8-approximation algorithm for MAX 3SAT?, in: Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS), 1997, pp. 406\u2013415.","DOI":"10.1109\/SFCS.1997.646129"},{"key":"10.1016\/S0304-3975(01)00078-0_BIB13","unstructured":"P. Kelly, Swiss scientists warn of robot Armageddon, CNN Online http:\/\/www.cnn.com\/TECH\/science\/9802\/18\/swiss.robot\/."},{"issue":"4","key":"10.1016\/S0304-3975(01)00078-0_BIB14","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/S0036144595284180","article-title":"Computer-assisted proofs in analysis and programming in logic: a case study","volume":"38","author":"Koch","year":"1996","journal-title":"SIAM Rev."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB15","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1090\/S0002-9904-1966-11654-3","article-title":"Counterexample to Euler's conjecture on sums of like powers","volume":"72","author":"Lander","year":"1966","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB16","first-page":"101","article-title":"A counterexample to Euler's sum of powers conjecture","volume":"21","author":"Lander","year":"1967","journal-title":"Math. Comput."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1090\/S0273-0979-1995-00558-6","article-title":"Choas in Lorenz equations: a computer assisted proof","volume":"33","author":"Mischaikow","year":"1995","journal-title":"Bull. AMS"},{"key":"10.1016\/S0304-3975(01)00078-0_BIB18","doi-asserted-by":"crossref","unstructured":"V. Pratt, Anatomy of the Pentium bug, in: Proc. of TAPSOFT \u201995: Theory and Practice of Software Development, 6th Internat. Joint Conf. on CAA\/FASE, 1995, pp. 97\u2013107.","DOI":"10.1007\/3-540-59293-8_189"},{"issue":"1","key":"10.1016\/S0304-3975(01)00078-0_BIB19","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01294261","article-title":"Randomized competitive algorithms for the list update problem","volume":"11","author":"Reingold","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00078-0_BIB20","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(91)90087-D","article-title":"Improved bounds for harmonic-based bin packing algorithms","volume":"34","author":"Richey","year":"1991","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/S0304-3975(01)00078-0_BIB21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s004530010014","article-title":"Randomized online multiprocessor scheduling","volume":"28","author":"Seiden","year":"2000","journal-title":"Algorithmica"},{"issue":"6","key":"10.1016\/S0304-3975(01)00078-0_BIB22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.2307\/2975571","article-title":"Short theorems with long proofs","volume":"90","author":"Spencer","year":"1983","journal-title":"Amer. Math. Monthly"},{"issue":"3","key":"10.1016\/S0304-3975(01)00078-0_BIB23","doi-asserted-by":"crossref","first-page":"553","DOI":"10.2307\/2118560","article-title":"Ring theoretic properties of certain Hecke algebras","volume":"141","author":"Taylor","year":"1995","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB24","doi-asserted-by":"crossref","unstructured":"L. Trevisan, G.B. Sorkin, M. Sudan, D.P. Williamson, Gadgets, approximation, and linear programming, in: Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 617\u2013626.","DOI":"10.1109\/SFCS.1996.548521"},{"issue":"42","key":"10.1016\/S0304-3975(01)00078-0_BIB25","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","article-title":"On computable numbers, with an application to the entscheidungsproblem","volume":"2","author":"Turing","year":"1937","journal-title":"Proc. London Math. Soc. Ser."},{"issue":"3","key":"10.1016\/S0304-3975(01)00078-0_BIB26","doi-asserted-by":"crossref","first-page":"443","DOI":"10.2307\/2118559","article-title":"Modular elliptic curves and Fermat's last theorem","volume":"141","author":"Wiles","year":"1995","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(01)00078-0_BIB27","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF02100618","article-title":"A algorithmic proof theory for hypergeometric (ordinary and \u201cq\u201d) multisum\/integral identities","volume":"108","author":"Wilf","year":"1992","journal-title":"Invent. Math."},{"issue":"8","key":"10.1016\/S0304-3975(01)00078-0_BIB28","first-page":"978","article-title":"Theorems for a price: tomorrow's semi-rigorous mathematical culture","volume":"40","author":"Zeilberger","year":"1993","journal-title":"Notices of the AMS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000780?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000780?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T15:55:51Z","timestamp":1583855751000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0304397501000780"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00078-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}