Split (1)

train · 485k rows

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.

id stringlengths 40 40	title stringlengths 15 120	text stringlengths 41 3.14k	source stringclasses 2 values
25ccae254ce83a52101c3dcceb87f9436afe7fae	mills is a marine biologist. in 2006 mills	mills is a marine biologist. in 2006 mills started work with national institute of water and atmospheric research taihoro nukurangi (niwa). in 2014 she became collections manager of the niwa invertebrate collection. this role heads a small team and is responsible for over 300,000 of preserved marine invertebrates speci...	wikipedia
8c87c4d0a17f10ad191b71d3b5ad7bfae56e3173	mills qualified with a master in science from	mills qualified with a master in science from otago university in 2006. her thesis is: benthic macrofauna assemblages of fragmented seagrass (zostera capricorni) beds in two southern new zealand inlets.	wikipedia
aa046e9628887e705266b421c9fdb70dbf691062	mills grew up in the united kingdom. she	mills grew up in the united kingdom. she knew from a young age she wanted to be a marine biologist. mills family moved to dunedin in the south island of new zealand when she was a teenager, and she went on to study at otago university.	wikipedia
c10b0b6ac32a99051b620fc4820cd293c265028f	victoria sadie mills is a new zealand marine	victoria sadie mills is a new zealand marine biologist and an invertebrate collection manager at new zealand's national institute of water and atmospheric research. mills specialises in the taxonomy of ophiuroidea and has written a book titled extraordinary echinoderms : a guide to the echinoderms of new zealand.	wikipedia
2c96d8251e5bbad168552935289ff0d431964505	justin brian melton, popularly known as quickmelt, mouse,	justin brian melton, popularly known as quickmelt, mouse, the flying minion, and minion, is a filipino-american former professional basketball player. he was drafted 13th overall by the san mig coffee mixers in the 2013 pba draft.	wikipedia
f6d531df8640f427fdb94189aa25d28d2b12f51e	on december 24, 2021, after only playing three	on december 24, 2021, after only playing three games for the dyip, melton was traded to the blackwater bossing for ed daquioag. melton became an unrestricted free agent on february 1, 2023. shortly after, he retired from professional basketball.	wikipedia
6ca91e64a94790c3ec27d50961a1c8fa920d6840	he shocked the whole pba, by winning the	he shocked the whole pba, by winning the 2014 pba all-star weekend slam dunk contest held in the mall of asia arena. he and rey guevarra had a head-to-head matchup on that battle, they have been tied for three rounds on the championship round, at last, they have been declared co-champions, because the process is going ...	wikipedia
63d0f8107a7894290a9340da0f3878792451aa03	melton was picked 13th overall by the mixers	melton was picked 13th overall by the mixers in the 2013 pba draft. melton was noticed as one of the most athletic players in his draft class, and he showcased that athleticism very fast with his teammates. though measured at just 5-foot-9 in socks, melton finished with several rim-rattling slams during practice. his e...	wikipedia
acd56de794c4ade05c70f3dd60b4477666115bae	melton studied and played basketball on a full	melton studied and played basketball on a full scholarship at mount olive college, in mount olive, north carolina where he was very successful. justin was a very tough player in college and was the leader and motor of the team for the last 3 seasons. he is extremely athletic can finish strong at the rim. he shot over 4...	wikipedia
a48d524461dc5cf46c80a31ee308d171a5901564	justin melton played high school basketball at tabb	justin melton played high school basketball at tabb high school in yorktown, virginia. after playing one year of junior varsity basketball, melton played three years of varsity basketball, capturing bay rivers district 1st team honors in his junior and senior seasons. in his senior season, he was awarded bay rivers dis...	wikipedia
18739e3b3ee41fb974084bd2d6d2bc1eb232cb1f	justin brian melton (born april 7, 1987), popularly	justin brian melton (born april 7, 1987), popularly known as quickmelt, mouse, the flying minion, and minion, is a filipino-american former professional basketball player. he was drafted 13th overall by the san mig coffee mixers in the 2013 pba draft.	wikipedia
f37fed9febc19cec862fb4e7b4008899e092085e	in computational complexity theory, the time hierarchy theorems	in computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on turing machines. informally, these theorems say that given more time, a turing machine can solve more problems. for example, there are problems that can be solved with n2 time but not n time, where...	wikipedia
4e780b9bbeb2963908fbca61a57dfe39bf5a2d4c	in computational complexity theory, the time hierarchy theorems	if g(n) is a time-constructible function, and f(n+1) = o(g(n)), then the analogous theorems for space are the space hierarchy theorems. a similar theorem is not known for time-bounded probabilistic complexity classes, unless the class also has one bit of advice.	wikipedia
e83ff87f87a72b072b9a544a4a706980532d8b7d	thus, a constant-factor increase in the time bound	thus, a constant-factor increase in the time bound allows for solving more problems, in contrast with the situation for turing machines (see linear speedup theorem). moreover, ben-amram proved that, in the above models, for f of polynomial growth rate (but more than linear), it is the case that for all ε > 0 {\displays...	wikipedia
e2f3489afbb8f947d714ba0bbfc2623c766853be	if f (n) is a time-constructible function, then	if f (n) is a time-constructible function, then there exists a decision problem which cannot be solved in worst-case deterministic time f (n) but can be solved in worst-case time af (n) for some constant a (dependent on f).	wikipedia
fefd44dc30492903e17050657b442e275dc78d69	the gap of approximately log f (n) {\displaystyle	the gap of approximately log f (n) {\displaystyle \log f(n)} between the lower and upper time bound in the hierarchy theorem can be traced to the efficiency of the device used in the proof, namely a universal program that maintains a step-count. this can be done more efficiently on certain computational models. the sha...	wikipedia
070adbf9ad3c3e961d68a25fe8c5fdcc8f529435	however, the time hierarchy theorems provide no means	however, the time hierarchy theorems provide no means to relate deterministic and non-deterministic complexity, or time and space complexity, so they cast no light on the great unsolved questions of computational complexity theory: whether p and np, np and pspace, pspace and exptime, or exptime and nexptime are equal o...	wikipedia
645a8210d824e80874f55620ade49383c96edddc	the theorem also guarantees that there are problems	the theorem also guarantees that there are problems in p requiring arbitrarily large exponents to solve; in other words, p does not collapse to dtime (n) for any fixed k. for example, there are problems solvable in n time but not n time. this is one argument against cobham's thesis, the convention that p is a practical...	wikipedia
96817822cc216378a7f9b0cac10308933b849b19	for example, p ⊊ e x p t	for example, p ⊊ e x p t i m e {\displaystyle {\mathsf {p}}\subsetneq {\mathsf {exptime}}} since p ⊆ d t i m e (2 n) ⊊ d t i m e (2 2 n) ⊆ e x p t i m e {\displaystyle {\mathsf {p}}\subseteq {\mathsf {dtime}}(2^{n})\subsetneq {\mathsf {dtime}}(2^{2n})\subseteq {\mathsf {exptime}}}. indeed, d t i m e (2 n) ⊆ d t i m e (...	wikipedia
6fbbf63ce94942160833f02154f6799df49b675d	the time hierarchy theorems guarantee that the deterministic	the time hierarchy theorems guarantee that the deterministic and non-deterministic versions of the exponential hierarchy are genuine hierarchies: in other words p ⊊ exptime ⊊ 2-exp ⊊... and np ⊊ nexptime ⊊ 2-nexp ⊊....	wikipedia
d81c4761de105ae786a684d276fd41cd177a547d	if g (n) is a time-constructible function, and	if g (n) is a time-constructible function, and f (n +1) = o (g (n)), then there exists a decision problem which cannot be solved in non-deterministic time f (n) but can be solved in non-deterministic time g (n). in other words, the complexity class ntime (f (n)) is a strict subset of ntime (g (n)).	wikipedia
f0bdcd6fa787214366f2832b70751ec7f90243c0	we use this k to construct another machine,	we use this k to construct another machine, n, which takes a machine description and runs k on the tuple (,), ie. m is simulated on its own code by k, and then n accepts if k rejects, and rejects if k accepts. if n is the length of the input to n, then m (the length of the input to k) is twice n plus some delimiter sym...	wikipedia
75994430be026bfd2a87a9a292b96dbc14ae3d53	we know that we can decide membership of	we know that we can decide membership of h by way of a deterministic turing machine r, that simulates m for f (x) steps by first calculating f (\| x \|) and then writing out a row of 0s of that length, and then using this row of 0s as a "clock" or "counter" to simulate m for at most that many steps. at each step, the sim...	wikipedia
a95fe0732760c71371b3da99ba07026165898020	we include here a proof of a weaker	we include here a proof of a weaker result, namely that dtime (f (n)) is a strict subset of dtime (f (2 n + 1)), as it is simpler but illustrates the proof idea. see the bottom of this section for information on how to extend the proof to f (n)log f (n).	wikipedia
1648f4be744659b0f5472a9ade720669c2aa3cbb	time hierarchy theorem. if f (n) is a	time hierarchy theorem. if f (n) is a time-constructible function, then there exists a decision problem which cannot be solved in worst-case deterministic time o (f (n)) but can be solved in worst-case deterministic time o (f (n)log f (n)). thus	wikipedia
978c1f5f990b7fa0d836c1edf3f76948cbc366f7	we need to prove that some time class	we need to prove that some time class time (g (n)) is strictly larger than some time class time (f (n)). we do this by constructing a machine which cannot be in time (f (n)), by diagonalization. we then show that the machine is in time (g (n)), using a simulator machine.	wikipedia
b64a20562195e8a7e2fd230353749bc146978cec	both theorems use the notion of a time-constructible	both theorems use the notion of a time-constructible function. a function f: n → n {\displaystyle f:\mathbb {n} \rightarrow \mathbb {n} } is time-constructible if there exists a deterministic turing machine such that for every n ∈ n {\displaystyle n\in \mathbb {n} }, if the machine is started with an input of n ones, i...	wikipedia
69437625555c076394d7ef838c2f5738b5b2481b	the time hierarchy theorem for nondeterministic turing machines	the time hierarchy theorem for nondeterministic turing machines was originally proven by stephen cook in 1972. it was improved to its current form via a complex proof by joel seiferas, michael fischer, and albert meyer in 1978. finally in 1983, stanislav Žák achieved the same result with the simple proof taught today. ...	wikipedia
9f4ca42c71c1db2230d12773a67a234b0ca7e010	in particular, this shows that d t i	in particular, this shows that d t i m e (n a) ⊊ d t i m e (n b) {\displaystyle {\mathsf {dtime}}(n^{a})\subsetneq {\mathsf {dtime}}(n^{b})} if and only if a < b {\displaystyle a<b}, so we have an infinite time hierarchy.	wikipedia
a7009c1abd1cbe6a3711384b5623d4068e38f5fd	where dtime (f (n)) denotes the complexity class	where dtime (f (n)) denotes the complexity class of decision problems solvable in time o (f (n)). the left-hand class involves little o notation, referring to the set of decision problems solvable in asymptotically less than f (n) time.	wikipedia
46605d0d6807a8b5907c987a177febeb4a16dbc9	the time hierarchy theorem for deterministic multi-tape turing	the time hierarchy theorem for deterministic multi-tape turing machines was first proven by richard e. stearns and juris hartmanis in 1965. it was improved a year later when f. c. hennie and richard e. stearns improved the efficiency of the universal turing machine. consequent to the theorem, for every deterministic ti...	wikipedia
638e02785b1f523c1fea58710942bcd7ca2fc355	in computational complexity theory, the time hierarchy theorems	in computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on turing machines. informally, these theorems say that given more time, a turing machine can solve more problems. for example, there are problems that can be solved with n time but not n time, where ...	wikipedia
82768cc231c66950df411505f59ee605ee1bb99a	the nokia lumia 930 is a high-end smartphone	the nokia lumia 930 is a high-end smartphone developed by nokia that shipped with microsoft's windows phone 8.1 operating system. it was announced on april 2, 2014 at microsoft build 2014 and was released in april 2014 as nokia's flagship. it is the last high-end nokia-branded lumia device and succeeded by the microsof...	wikipedia
e4cc1b33b1061e413efc113acd3cdd1adec94966	a significant number of lumia 930 users have	a significant number of lumia 930 users have reported an issue with the operation of the audio microphones, where handsfree calls and video recordings have very low audio levels. this has been confirmed to be caused by a motherboard fault. there have been a number of reports of this being a software issue introduced wi...	wikipedia
07521d89838d62c7d06e5e6fe37fc7991f500847	the lumia 930 has a 5.0-inch amoled display,	the lumia 930 has a 5.0-inch amoled display, quad-core 2.2 ghz krait 400 qualcomm snapdragon 800 processor, 2 gb of ram and 32 gb of internal storage. the phone has a 2420 mah li-ion battery, 20 mp rear camera and 1.2 mp front-facing camera. it is available in orange, green, white, black and gold.	wikipedia
f02d5d6a77e5026d12a614814e54de4f6d8d988b	neither the 930 nor the icon have the	neither the 930 nor the icon have the glance feature, which displays the time and other selectable information on the display of an otherwise sleeping phone. while other contemporary nokia smartphones have glance, the 930 and icon do not because their displays lack the necessary "display memory" feature.	wikipedia
8afeda58180218aaad9ac0df12aa2fccfc24d37b	the nokia lumia icon, which is exclusive to	the nokia lumia icon, which is exclusive to verizon wireless in the united states, is essentially a derivative of the lumia 930. the two versions share a common design and specifications; the only hardware difference is that the 930 is equipped with gsm radios and available as both carrier-locked and unlocked versions,...	wikipedia
b06b1919a4e2a321fbbbd7774067ae7881e86d26	the nokia lumia 930 (codenamed martini) is a	the nokia lumia 930 (codenamed martini) is a high-end smartphone developed by nokia that shipped with microsoft's windows phone 8.1 operating system. it was announced on april 2, 2014 at microsoft build 2014 and was released in april 2014 as nokia's (and later microsoft mobile 's) flagship. it is the last high-end noki...	wikipedia
7252a6f1f7795ccdec547787e634d3873de76234	wolfgang grodd is a german neuroradiologist and professor	wolfgang grodd is a german neuroradiologist and professor emeritus of the university hospital at the university of tübingen. he is known for his scientific works on the development and application of structural and functional magnetic resonance imaging in metabolic diseases, sensorimotor representation, language produc...	wikipedia
12ae7c7814d673a41f259f2007a318f441659892	for his scientific research activity, grodd was awarded	for his scientific research activity, grodd was awarded the "kurt-decker award" of the german society for neuroradiology in 1988, 1989, 1992 and in 1998. in 1989 the german society for neurotraumatology honored him for his outstanding scientific work.	wikipedia